{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:WBUYBSJWSDFQWUKFZQQJAFYWDQ","short_pith_number":"pith:WBUYBSJW","schema_version":"1.0","canonical_sha256":"b06980c93690cb0b5145cc209017161c15daec83499850dae56679b085498d6b","source":{"kind":"arxiv","id":"2502.11561","version":4},"attestation_state":"computed","paper":{"title":"Resident fitness computation in linear time and other algorithmic aspects of interacting trajectories","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"Resident fitness for n interacting trajectories is computable in O(n) time.","cross_cats":["math.PR"],"primary_cat":"cs.DS","authors_text":"Andr\\'as T\\'obi\\'as, Katalin Friedl, Vikt\\'oria Nemkin","submitted_at":"2025-02-17T08:48:29Z","abstract_excerpt":"Systems of interacting trajectories were recently studied in~\\cite{HGSTW24}. Such a system of $[0,1]$-valued piecewise linear trajectories arises as a scaling limit of the system of logarithmic subpopulation sizes in a population-genetic model (more precisely, a Moran model) with mutation and selection. By definition, the resident fitness is initially 0 and afterwards it increases by the ultimate slope of each trajectory that reaches height 1.\n  We show that although the interaction of $n$ trajectories may yield $\\Omega(n^2)$ slope changes in total, the resident fitness function can be compute"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2502.11561","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2025-02-17T08:48:29Z","cross_cats_sorted":["math.PR"],"title_canon_sha256":"06acc37a7ea921241309a42606065b7345ecfbe16eab06d31f9216a8b3b7e009","abstract_canon_sha256":"2e6ed5d4f32f39b4a86d0944af6564cf1a2f33e541a1d02f5ce4f0f8d9dd1a17"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-10T01:09:15.582181Z","signature_b64":"OZs6jllWo9gNxHAldzgsiHPcPZTKIyekzZbFPPczIj9DTSMiACju+bXCEj2woBn20joarY4H8LGpblfnJ8ycCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b06980c93690cb0b5145cc209017161c15daec83499850dae56679b085498d6b","last_reissued_at":"2026-06-10T01:09:15.581181Z","signature_status":"signed_v1","first_computed_at":"2026-06-10T01:09:15.581181Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Resident fitness computation in linear time and other algorithmic aspects of interacting trajectories","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"Resident fitness for n interacting trajectories is computable in O(n) time.","cross_cats":["math.PR"],"primary_cat":"cs.DS","authors_text":"Andr\\'as T\\'obi\\'as, Katalin Friedl, Vikt\\'oria Nemkin","submitted_at":"2025-02-17T08:48:29Z","abstract_excerpt":"Systems of interacting trajectories were recently studied in~\\cite{HGSTW24}. Such a system of $[0,1]$-valued piecewise linear trajectories arises as a scaling limit of the system of logarithmic subpopulation sizes in a population-genetic model (more precisely, a Moran model) with mutation and selection. By definition, the resident fitness is initially 0 and afterwards it increases by the ultimate slope of each trajectory that reaches height 1.\n  We show that although the interaction of $n$ trajectories may yield $\\Omega(n^2)$ slope changes in total, the resident fitness function can be compute"},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"Although the interaction of n trajectories may yield Ω(n²) slope changes in total, the resident fitness function can be computed algorithmically in O(n) time.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"The system consists of [0,1]-valued piecewise linear trajectories whose interactions are captured by the continued lines representation, and resident fitness is defined precisely as the cumulative sum of ultimate slopes of trajectories reaching height 1; this representation must allow direct computation without enumerating all slope changes.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"Resident fitness in systems of n interacting [0,1]-valued piecewise linear trajectories can be computed in O(n) time.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"Resident fitness for n interacting trajectories is computable in O(n) time.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"35449959e631f87f62330297ea9b8db5ea7665d9cb2d1bfb9f54a4fecab65a9c"},"source":{"id":"2502.11561","kind":"arxiv","version":4},"verdict":{"id":"658c84d1-ccda-4990-b048-2e30289bdf1f","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-23T03:09:35.250103Z","strongest_claim":"Although the interaction of n trajectories may yield Ω(n²) slope changes in total, the resident fitness function can be computed algorithmically in O(n) time.","one_line_summary":"Resident fitness in systems of n interacting [0,1]-valued piecewise linear trajectories can be computed in O(n) time.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"The system consists of [0,1]-valued piecewise linear trajectories whose interactions are captured by the continued lines representation, and resident fitness is defined precisely as the cumulative sum of ultimate slopes of trajectories reaching height 1; this representation must allow direct computation without enumerating all slope changes.","pith_extraction_headline":"Resident fitness for n interacting trajectories is computable in O(n) time."},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2502.11561/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"aliases":[{"alias_kind":"arxiv","alias_value":"2502.11561","created_at":"2026-06-10T01:09:15.581307+00:00"},{"alias_kind":"arxiv_version","alias_value":"2502.11561v4","created_at":"2026-06-10T01:09:15.581307+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2502.11561","created_at":"2026-06-10T01:09:15.581307+00:00"},{"alias_kind":"pith_short_12","alias_value":"WBUYBSJWSDFQ","created_at":"2026-06-10T01:09:15.581307+00:00"},{"alias_kind":"pith_short_16","alias_value":"WBUYBSJWSDFQWUKF","created_at":"2026-06-10T01:09:15.581307+00:00"},{"alias_kind":"pith_short_8","alias_value":"WBUYBSJW","created_at":"2026-06-10T01:09:15.581307+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2502.11561","citing_title":"Resident fitness computation in linear time and other algorithmic aspects of interacting trajectories","ref_index":14,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/WBUYBSJWSDFQWUKFZQQJAFYWDQ","json":"https://pith.science/pith/WBUYBSJWSDFQWUKFZQQJAFYWDQ.json","graph_json":"https://pith.science/api/pith-number/WBUYBSJWSDFQWUKFZQQJAFYWDQ/graph.json","events_json":"https://pith.science/api/pith-number/WBUYBSJWSDFQWUKFZQQJAFYWDQ/events.json","paper":"https://pith.science/paper/WBUYBSJW"},"agent_actions":{"view_html":"https://pith.science/pith/WBUYBSJWSDFQWUKFZQQJAFYWDQ","download_json":"https://pith.science/pith/WBUYBSJWSDFQWUKFZQQJAFYWDQ.json","view_paper":"https://pith.science/paper/WBUYBSJW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2502.11561&json=true","fetch_graph":"https://pith.science/api/pith-number/WBUYBSJWSDFQWUKFZQQJAFYWDQ/graph.json","fetch_events":"https://pith.science/api/pith-number/WBUYBSJWSDFQWUKFZQQJAFYWDQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WBUYBSJWSDFQWUKFZQQJAFYWDQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WBUYBSJWSDFQWUKFZQQJAFYWDQ/action/storage_attestation","attest_author":"https://pith.science/pith/WBUYBSJWSDFQWUKFZQQJAFYWDQ/action/author_attestation","sign_citation":"https://pith.science/pith/WBUYBSJWSDFQWUKFZQQJAFYWDQ/action/citation_signature","submit_replication":"https://pith.science/pith/WBUYBSJWSDFQWUKFZQQJAFYWDQ/action/replication_record"}},"created_at":"2026-06-10T01:09:15.581307+00:00","updated_at":"2026-06-10T01:09:15.581307+00:00"}