{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:WBUYBSJWSDFQWUKFZQQJAFYWDQ","short_pith_number":"pith:WBUYBSJW","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"},"canonical_sha256":"b06980c93690cb0b5145cc209017161c15daec83499850dae56679b085498d6b","source":{"kind":"arxiv","id":"2502.11561","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2502.11561","created_at":"2026-06-10T01:09:15Z"},{"alias_kind":"arxiv_version","alias_value":"2502.11561v4","created_at":"2026-06-10T01:09:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2502.11561","created_at":"2026-06-10T01:09:15Z"},{"alias_kind":"pith_short_12","alias_value":"WBUYBSJWSDFQ","created_at":"2026-06-10T01:09:15Z"},{"alias_kind":"pith_short_16","alias_value":"WBUYBSJWSDFQWUKF","created_at":"2026-06-10T01:09:15Z"},{"alias_kind":"pith_short_8","alias_value":"WBUYBSJW","created_at":"2026-06-10T01:09:15Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:WBUYBSJWSDFQWUKFZQQJAFYWDQ","target":"record","payload":{"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"},"canonical_sha256":"b06980c93690cb0b5145cc209017161c15daec83499850dae56679b085498d6b","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"},"source_kind":"arxiv","source_id":"2502.11561","source_version":4,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-06-10T01:09:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wtFFAXdnX7viklqYMWA6MLh37qr4OHVW0MCxBbcSr/CHjJGhSOC1tsnNYXpWnDolgt4Y4iiTcnbc3t0PwH92Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T07:27:34.421327Z"},"content_sha256":"c1102c1bbcdff72f38c40f91deded67a1571ed27307e9d5a933a6c1ebceb17ba","schema_version":"1.0","event_id":"sha256:c1102c1bbcdff72f38c40f91deded67a1571ed27307e9d5a933a6c1ebceb17ba"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:WBUYBSJWSDFQWUKFZQQJAFYWDQ","target":"graph","payload":{"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"},"verdict_id":"658c84d1-ccda-4990-b048-2e30289bdf1f"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-06-10T01:09:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ony6Bt82w7OwS41ImXW0+O2aSjSHLG/qVzs4KDQ+Y1LfcLWm3ONZ7zi4bLf6S84qnGRHX2VLn7yWG8SrdWhtCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T07:27:34.422180Z"},"content_sha256":"7b6e585e65b91e22f6ff3c7288bc53b2ac4c8ee4aaf23bfd8738b5d24ad3cc4f","schema_version":"1.0","event_id":"sha256:7b6e585e65b91e22f6ff3c7288bc53b2ac4c8ee4aaf23bfd8738b5d24ad3cc4f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WBUYBSJWSDFQWUKFZQQJAFYWDQ/bundle.json","state_url":"https://pith.science/pith/WBUYBSJWSDFQWUKFZQQJAFYWDQ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WBUYBSJWSDFQWUKFZQQJAFYWDQ/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-23T07:27:34Z","links":{"resolver":"https://pith.science/pith/WBUYBSJWSDFQWUKFZQQJAFYWDQ","bundle":"https://pith.science/pith/WBUYBSJWSDFQWUKFZQQJAFYWDQ/bundle.json","state":"https://pith.science/pith/WBUYBSJWSDFQWUKFZQQJAFYWDQ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WBUYBSJWSDFQWUKFZQQJAFYWDQ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:WBUYBSJWSDFQWUKFZQQJAFYWDQ","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"2e6ed5d4f32f39b4a86d0944af6564cf1a2f33e541a1d02f5ce4f0f8d9dd1a17","cross_cats_sorted":["math.PR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2025-02-17T08:48:29Z","title_canon_sha256":"06acc37a7ea921241309a42606065b7345ecfbe16eab06d31f9216a8b3b7e009"},"schema_version":"1.0","source":{"id":"2502.11561","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2502.11561","created_at":"2026-06-10T01:09:15Z"},{"alias_kind":"arxiv_version","alias_value":"2502.11561v4","created_at":"2026-06-10T01:09:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2502.11561","created_at":"2026-06-10T01:09:15Z"},{"alias_kind":"pith_short_12","alias_value":"WBUYBSJWSDFQ","created_at":"2026-06-10T01:09:15Z"},{"alias_kind":"pith_short_16","alias_value":"WBUYBSJWSDFQWUKF","created_at":"2026-06-10T01:09:15Z"},{"alias_kind":"pith_short_8","alias_value":"WBUYBSJW","created_at":"2026-06-10T01:09:15Z"}],"graph_snapshots":[{"event_id":"sha256:7b6e585e65b91e22f6ff3c7288bc53b2ac4c8ee4aaf23bfd8738b5d24ad3cc4f","target":"graph","created_at":"2026-06-10T01:09:15Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":4,"items":[{"attestation":"unclaimed","claim_id":"C1","kind":"strongest_claim","source":"verdict.strongest_claim","status":"machine_extracted","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."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","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."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"Resident fitness in systems of n interacting [0,1]-valued piecewise linear trajectories can be computed in O(n) time."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"Resident fitness for n interacting trajectories is computable in O(n) time."}],"snapshot_sha256":"35449959e631f87f62330297ea9b8db5ea7665d9cb2d1bfb9f54a4fecab65a9c"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2502.11561/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Andr\\'as T\\'obi\\'as, Katalin Friedl, Vikt\\'oria Nemkin","cross_cats":["math.PR"],"headline":"Resident fitness for n interacting trajectories is computable in O(n) time.","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2025-02-17T08:48:29Z","title":"Resident fitness computation in linear time and other algorithmic aspects of interacting trajectories"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2502.11561","kind":"arxiv","version":4},"verdict":{"created_at":"2026-05-23T03:09:35.250103Z","id":"658c84d1-ccda-4990-b048-2e30289bdf1f","model_set":{"reader":"grok-4.3"},"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","pith_extraction_headline":"Resident fitness for n interacting trajectories is computable in O(n) time.","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.","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."}},"verdict_id":"658c84d1-ccda-4990-b048-2e30289bdf1f"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:c1102c1bbcdff72f38c40f91deded67a1571ed27307e9d5a933a6c1ebceb17ba","target":"record","created_at":"2026-06-10T01:09:15Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"2e6ed5d4f32f39b4a86d0944af6564cf1a2f33e541a1d02f5ce4f0f8d9dd1a17","cross_cats_sorted":["math.PR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2025-02-17T08:48:29Z","title_canon_sha256":"06acc37a7ea921241309a42606065b7345ecfbe16eab06d31f9216a8b3b7e009"},"schema_version":"1.0","source":{"id":"2502.11561","kind":"arxiv","version":4}},"canonical_sha256":"b06980c93690cb0b5145cc209017161c15daec83499850dae56679b085498d6b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b06980c93690cb0b5145cc209017161c15daec83499850dae56679b085498d6b","first_computed_at":"2026-06-10T01:09:15.581181Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-10T01:09:15.581181Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"OZs6jllWo9gNxHAldzgsiHPcPZTKIyekzZbFPPczIj9DTSMiACju+bXCEj2woBn20joarY4H8LGpblfnJ8ycCg==","signature_status":"signed_v1","signed_at":"2026-06-10T01:09:15.582181Z","signed_message":"canonical_sha256_bytes"},"source_id":"2502.11561","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c1102c1bbcdff72f38c40f91deded67a1571ed27307e9d5a933a6c1ebceb17ba","sha256:7b6e585e65b91e22f6ff3c7288bc53b2ac4c8ee4aaf23bfd8738b5d24ad3cc4f"],"state_sha256":"f3470e9cac254b60effc460b32b3dd1738cba1e41f180346dc67e167c995fa96"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"N66q+X2t8AftO9a4zzW4KQ8NTtjV/kLao5pe4alptsISQ92JmPq0Ip/iYhtZY87MTyxUgcRpl0Vg5xFr9HY+DQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-23T07:27:34.425752Z","bundle_sha256":"35d23af644fc02e88e68fcf7e1cc27e048d2e791cde2968d2f689a9fbf3e5362"}}