[ { "@id": "https://w3id.org/np/RAnXdV6NLvYVkytweYLvFpZTAHq3NDaKgs1ebf5z7mjlo/Head", "@graph": [ { "@id": "https://w3id.org/np/RAnXdV6NLvYVkytweYLvFpZTAHq3NDaKgs1ebf5z7mjlo", "http://www.nanopub.org/nschema#hasAssertion": [ { "@id": "https://w3id.org/np/RAnXdV6NLvYVkytweYLvFpZTAHq3NDaKgs1ebf5z7mjlo/assertion" } ], "http://www.nanopub.org/nschema#hasProvenance": [ { "@id": "https://w3id.org/np/RAnXdV6NLvYVkytweYLvFpZTAHq3NDaKgs1ebf5z7mjlo/provenance" } ], "http://www.nanopub.org/nschema#hasPublicationInfo": [ { "@id": "https://w3id.org/np/RAnXdV6NLvYVkytweYLvFpZTAHq3NDaKgs1ebf5z7mjlo/pubinfo" } ], "@type": [ "http://www.nanopub.org/nschema#Nanopublication" ] } ] }, { "@id": "https://w3id.org/np/RAnXdV6NLvYVkytweYLvFpZTAHq3NDaKgs1ebf5z7mjlo/pubinfo", "@graph": [ { "@id": "https://w3id.org/np/RAnXdV6NLvYVkytweYLvFpZTAHq3NDaKgs1ebf5z7mjlo", "http://purl.org/dc/terms/created": [ { "@value": "2026-11-08T16:24:31.885Z", "@type": "http://www.w3.org/2001/XMLSchema#dateTime" } ], "http://purl.org/dc/terms/creator": [ { "@id": "https://orcid.org/0009-0007-4948-9192" } ], "http://purl.org/dc/terms/license": [ { "@id": "https://creativecommons.org/licenses/by/4.0/" } ], "http://purl.org/nanopub/x/hasNanopubType": [ { "@id": "https://w3id.org/delphi/ontology/Assessment" } ], "http://purl.org/nanopub/x/introduces": [ { "@id": "https://w3id.org/delphi/resource/assessment/hamilton-rule--claim-test--overnight-hamiltons-moran" } ], "http://www.w3.org/2000/01/rdf-schema#label": [ { "@value": "Claim test of hamilton-rule (overnight-hamiltons-moran): inconclusive, confidence 0.99" } ], "https://w3id.org/delphi/ontology/domain": [ { "@id": "https://w3id.org/delphi/resource/domain/math-bio-claims" } ] }, { "@id": "https://w3id.org/np/RAnXdV6NLvYVkytweYLvFpZTAHq3NDaKgs1ebf5z7mjlo/sig", "http://purl.org/nanopub/x/hasAlgorithm": [ { "@value": "RSA" } ], "http://purl.org/nanopub/x/hasPublicKey": [ { "@value": "MIIBIjANBgkqhkiG9w0BAQEFAAOCAQ8AMIIBCgKCAQEAyFHtPB6p0mCjDozxlOY9CmO3nBm7Te3jFbXyLmM+G1tGe47Da0jYIbhkl9Oo1ZjxmCa3LCwlEqK8gj6hEIcL4ahW30JXh9HycfKVk1bugkzMEV15tJdTzAU3sGMFnbNsn43xY2LFLy45tApkRm5byEiM7oRRrooIdwoQKnP4Wzq/bfAoJ9qvW+MGkelyOTd1jbSt+KfmT7xKmDfWzAHddUlWwMX2QJOLxDaffOteTop6ZRgPiNmPJKA/S62Gac9XtSYT3oDkZ6/nr5cxxNLpOyxTf5FPISiCe11xYO/unYjY+mwnOfA8yhJIyx1l0O9I0vpOpn+E5TvyHJV+oSTrvwIDAQAB" } ], "http://purl.org/nanopub/x/hasSignature": [ { "@value": "ZekaOrEK1c7rVPfKS1sEMwrF6t4srAmOltgMAe65dmdr9C1a8scKm+eNyGX7492ea+qyIbY543kedqMYkTdH6h4WaKAub0eHa+ot/ZU/ZawTubME2OhPAOW5zlT7dC5cCGdvm9oePDJILXTSp9KTAIvhSjLfuPIVM9V1ZrvRa6DSFsDqTxycP/cLulcF+WmQOEYARskvt2YrmmdccIBJFygtSVa6R/wQWaXN0juFvzzKKXPO4nRg5F6iKRx6zMfoi2KxjQTVaS39e8yIQusikikDcJk/KCdahT/tyWjVdNt8sK9mFtqxKF7gH9SyhXu/NClVfqnut1zkNrfJ3msQrg==" } ], "http://purl.org/nanopub/x/hasSignatureTarget": [ { "@id": "https://w3id.org/np/RAnXdV6NLvYVkytweYLvFpZTAHq3NDaKgs1ebf5z7mjlo" } ], "http://purl.org/nanopub/x/signedBy": [ { "@id": "https://orcid.org/0009-0007-4948-9192" } ] } ] }, { "@id": "https://w3id.org/np/RAnXdV6NLvYVkytweYLvFpZTAHq3NDaKgs1ebf5z7mjlo/assertion", "@graph": [ { "@id": "https://w3id.org/delphi/resource/assessment/hamilton-rule--claim-test--overnight-hamiltons-moran", "http://purl.org/dc/terms/description": [ { "@value": "Enumerate all 64 labelled binary configurations of six haploids in three fixed pairs using fractions.Fraction. For each configuration, compute exact fitnesses and all Moran birth-death transitions, then uniformly average transitions conditional on cooperator count to emit the requested seven-row table. Fit exact ordinary least-squares coefficients to pooled individual records at each count, freeze the count-three coefficients for the additive predictor, and compare both predictor signs with the aggregated expected frequency change." } ], "@type": [ "https://w3id.org/delphi/ontology/Assessment" ], "http://www.w3.org/2000/01/rdf-schema#comment": [ { "@value": "Measured: 0 preregistered-pass indicator (n = 5, none; exact rational arithmetic). Interpretation: The method cannot literally define the requested seven-state chain: with three fixed pairs, configurations having the same cooperator count can have different transition probabilities, and the absorbing no-mutation chain has no unique stationary conditional distribution on transient three-cooperator configurations. To make the requested count table computable without adding data or stochastic error, the analysis enumerated all 64 labelled configurations and uniformly averaged configurations conditional on each count; this is an explicit closure convention, not a true lumping of the fixed-pair chain. Under that convention the pre-registered criterion fails because the refit predictor disagrees at counts 2 and 3, but this does not refute the regression identity or the target claim because the averaging mixes distinct population states and their fitness normalizations." } ], "http://www.w3.org/2000/01/rdf-schema#label": [ { "@value": "Claim test of hamilton-rule (overnight-hamiltons-moran): inconclusive, confidence 0.99" } ], "http://www.w3.org/2000/01/rdf-schema#seeAlso": [ { "@id": "https://github.com/fractastical/delphisci/blob/bf2af6ee0a84e23ffa6414ad7a0a50a8c276506e/test-data/claim-tests/math-bio-claims/hamilton-rule/overnight-hamiltons-moran/result.json" } ], "http://www.w3.org/ns/prov#wasAttributedTo": [ { "@id": "https://w3id.org/delphi/resource/agent/delphisci-claim-tester-gpt-5-6-sol" } ], "https://w3id.org/delphi/ontology/admissibleDatasets": [ { "@value": "" } ], "https://w3id.org/delphi/ontology/assessmentType": [ { "@value": "claim-test/0.1.0" } ], "https://w3id.org/delphi/ontology/dataKind": [ { "@value": "computational" } ], "https://w3id.org/delphi/ontology/disconfirmingObservation": [ { "@value": "The frozen additive predictor agrees in sign at every state, or the refit regression disagrees with any nonzero exact expected frequency change." } ], "https://w3id.org/delphi/ontology/evidenceAgainst": [ { "@value": "The computation tests a finite closure convention, not whether organisms obey Hamilton's rule and not the full exact-scope problem." }, { "@value": "The phrase stationary-conditional fitnesses is undefined without mutation or another conditioning construction because the stated chain is absorbing." }, { "@value": "Uniform conditional averaging was not specified by the approach and is not preserved by the fixed-pair Moran dynamics." } ], "https://w3id.org/delphi/ontology/expectedObservation": [ { "@value": "The refit regression matches the sign of exact expected frequency change at every non-absorbing state with nonzero expected change, and the frozen predictor disagrees in sign at least once at an endpoint state." } ], "https://w3id.org/delphi/ontology/failCriterion": [ { "@value": "The frozen additive predictor agrees in sign at every state, or the refit regression disagrees with any nonzero exact expected frequency change." } ], "https://w3id.org/delphi/ontology/hasConfidence": [ { "@value": "0.99", "@type": "http://www.w3.org/2001/XMLSchema#double" } ], "https://w3id.org/delphi/ontology/hasEvidence": [ { "@list": [ ] } ], "https://w3id.org/delphi/ontology/hasVerdict": [ { "@value": "inconclusive" } ], "https://w3id.org/delphi/ontology/hypothesis": [ { "@value": "In the specified exact N = 6 paired Moran model, a regression predictor refit at each non-absorbing state has the same sign as exact expected frequency change, while coefficients frozen from frequency 1/2 have the wrong sign in at least one endpoint state." } ], "https://w3id.org/delphi/ontology/inferenceMethod": [ { "@value": "Enumerate all 64 labelled binary configurations of six haploids in three fixed pairs using fractions.Fraction. For each configuration, compute exact fitnesses and all Moran birth-death transitions, then uniformly average transitions conditional on cooperator count to emit the requested seven-row table. Fit exact ordinary least-squares coefficients to pooled individual records at each count, freeze the count-three coefficients for the additive predictor, and compare both predictor signs with the aggregated expected frequency change." } ], "https://w3id.org/delphi/ontology/passCriterion": [ { "@value": "The refit regression matches the sign of exact expected frequency change at every non-absorbing state with nonzero expected change, and the frozen predictor disagrees in sign at least once at an endpoint state." } ], "https://w3id.org/delphi/ontology/preregistered": [ { "@value": "false", "@type": "http://www.w3.org/2001/XMLSchema#boolean" } ] }, { "@id": "https://w3id.org/delphi/resource/claim/hamilton-rule", "https://w3id.org/delphi/ontology/hasAssessment": [ { "@id": "https://w3id.org/delphi/resource/assessment/hamilton-rule--claim-test--overnight-hamiltons-moran" } ] } ] }, { "@id": "https://w3id.org/np/RAnXdV6NLvYVkytweYLvFpZTAHq3NDaKgs1ebf5z7mjlo/provenance", "@graph": [ { "@id": "https://w3id.org/delphi/resource/agent/delphisci-claim-tester-gpt-5-6-sol", "@type": [ "http://www.w3.org/ns/prov#SoftwareAgent" ], "http://www.w3.org/2000/01/rdf-schema#label": [ { "@value": "delphisci claim tester (gpt-5.6-sol; hamiltons-rule-exact-scope--grok-4-7--2)" } ], "http://www.w3.org/ns/prov#actedOnBehalfOf": [ { "@id": "https://orcid.org/0009-0007-4948-9192" } ], "https://w3id.org/delphi/ontology/usesModel": [ { "@id": "https://w3id.org/delphi/resource/model/gpt-5-6-sol" } ] }, { "@id": "https://w3id.org/delphi/resource/model/gpt-5-6-sol", "http://purl.org/dc/terms/identifier": [ { "@value": "gpt-5.6-sol" } ], "@type": [ "https://w3id.org/delphi/ontology/LanguageModel" ] }, { "@id": "https://w3id.org/np/RAnXdV6NLvYVkytweYLvFpZTAHq3NDaKgs1ebf5z7mjlo/assertion", "http://www.w3.org/ns/prov#wasAttributedTo": [ { "@id": "https://w3id.org/delphi/resource/agent/delphisci-claim-tester-gpt-5-6-sol" } ], "http://www.w3.org/ns/prov#wasDerivedFrom": [ { "@id": "https://github.com/fractastical/delphisci/blob/bf2af6ee0a84e23ffa6414ad7a0a50a8c276506e/test-data/claim-tests/math-bio-claims/hamilton-rule/overnight-hamiltons-moran/result.json" } ], "http://www.w3.org/ns/prov#wasGeneratedBy": [ { "@id": "https://w3id.org/np/RAnXdV6NLvYVkytweYLvFpZTAHq3NDaKgs1ebf5z7mjlo/test" } ] }, { "@id": "https://w3id.org/np/RAnXdV6NLvYVkytweYLvFpZTAHq3NDaKgs1ebf5z7mjlo/test", "@type": [ "http://www.w3.org/ns/prov#Activity" ], "http://www.w3.org/ns/prov#qualifiedAssociation": [ { "@id": "https://w3id.org/np/RAnXdV6NLvYVkytweYLvFpZTAHq3NDaKgs1ebf5z7mjlo/plan" } ], "http://www.w3.org/ns/prov#wasAssociatedWith": [ { "@id": "https://w3id.org/delphi/resource/agent/delphisci-claim-tester-gpt-5-6-sol" } ] }, { "@id": "https://w3id.org/np/RAnXdV6NLvYVkytweYLvFpZTAHq3NDaKgs1ebf5z7mjlo/plan", "http://www.w3.org/ns/prov#hadPlan": [ { "@id": "https://github.com/fractastical/delphisci/blob/bf2af6ee0a84e23ffa6414ad7a0a50a8c276506e/test-data/claim-tests/README.md" } ] } ] } ]