{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:MC3UFFSFQBF3TKAACEUF5DRVWX","short_pith_number":"pith:MC3UFFSF","canonical_record":{"source":{"id":"2412.07964","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2024-12-10T23:06:32Z","cross_cats_sorted":["cs.CG","cs.NI"],"title_canon_sha256":"4d43284e6078700c6de630bd4c7d3b8254fed09845ac33ef262636a727144866","abstract_canon_sha256":"c6ffc71e1cdd2beca9034469827693c13343ce3f83d8dcf80ac05dae139683d0"},"schema_version":"1.0"},"canonical_sha256":"60b7429645804bb9a80011285e8e35b5df141cc09a26d2d6c73759d2097c8789","source":{"kind":"arxiv","id":"2412.07964","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2412.07964","created_at":"2026-07-05T09:50:37Z"},{"alias_kind":"arxiv_version","alias_value":"2412.07964v2","created_at":"2026-07-05T09:50:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2412.07964","created_at":"2026-07-05T09:50:37Z"},{"alias_kind":"pith_short_12","alias_value":"MC3UFFSFQBF3","created_at":"2026-07-05T09:50:37Z"},{"alias_kind":"pith_short_16","alias_value":"MC3UFFSFQBF3TKAA","created_at":"2026-07-05T09:50:37Z"},{"alias_kind":"pith_short_8","alias_value":"MC3UFFSF","created_at":"2026-07-05T09:50:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:MC3UFFSFQBF3TKAACEUF5DRVWX","target":"record","payload":{"canonical_record":{"source":{"id":"2412.07964","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2024-12-10T23:06:32Z","cross_cats_sorted":["cs.CG","cs.NI"],"title_canon_sha256":"4d43284e6078700c6de630bd4c7d3b8254fed09845ac33ef262636a727144866","abstract_canon_sha256":"c6ffc71e1cdd2beca9034469827693c13343ce3f83d8dcf80ac05dae139683d0"},"schema_version":"1.0"},"canonical_sha256":"60b7429645804bb9a80011285e8e35b5df141cc09a26d2d6c73759d2097c8789","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:50:37.013862Z","signature_b64":"UMndTCMztISc5eahAzJQ2ayS6BImbX3FHR7U9VEKi5A2kn+0viYn+ZUPeKfHP5PtMEzp91s+42P7n2VDBub/DA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"60b7429645804bb9a80011285e8e35b5df141cc09a26d2d6c73759d2097c8789","last_reissued_at":"2026-07-05T09:50:37.013303Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:50:37.013303Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2412.07964","source_version":2,"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-07-05T09:50:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"D5cXKGo5odSSs3L4zoepl6RXkejB4e0XPRFvLntttqBYXmPy+F9FsszLEypeKlhoi5ewYS6QxWK/x2TtRqHXCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-06T21:49:10.870928Z"},"content_sha256":"2366850efefe69ef3c29ec2047e9ddffbac73021c2633ff194d5df5a5f4c4467","schema_version":"1.0","event_id":"sha256:2366850efefe69ef3c29ec2047e9ddffbac73021c2633ff194d5df5a5f4c4467"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:MC3UFFSFQBF3TKAACEUF5DRVWX","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Geometry helps in routing scalability","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CG","cs.NI"],"primary_cat":"cs.DS","authors_text":"Matt Piekenbrock","submitted_at":"2024-12-10T23:06:32Z","abstract_excerpt":"Delay Tolerant Networking (DTN) aims to address a myriad of significant networking challenges that appear in time-varying settings, such as mobile and satellite networks, wherein changes in network topology are frequent and often subject to environmental constraints. Within this paradigm, routing problems are often solved by extending classical graph-theoretic path finding algorithms, such as the Bellman-Ford or Floyd-Warshall algorithms, to the time-varying setting; such extensions are simple to understand, but they have strict optimality criteria and can exhibit non-polynomial scaling. Ackno"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2412.07964","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2412.07964/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":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T09:50:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MLSw4vxI3i0eHRIy4Q7Cy+1oPQoekwX+K8OhXOOSvoALMJWTEvt7Z0GPjC20Jp3ItT+rh1oqu3uZ62RDXC0xAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-06T21:49:10.871298Z"},"content_sha256":"f2eb93322d48b11677056c37394fe149ba8902bf832fb9eadfcb1b7f920e7a0e","schema_version":"1.0","event_id":"sha256:f2eb93322d48b11677056c37394fe149ba8902bf832fb9eadfcb1b7f920e7a0e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MC3UFFSFQBF3TKAACEUF5DRVWX/bundle.json","state_url":"https://pith.science/pith/MC3UFFSFQBF3TKAACEUF5DRVWX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MC3UFFSFQBF3TKAACEUF5DRVWX/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-07-06T21:49:10Z","links":{"resolver":"https://pith.science/pith/MC3UFFSFQBF3TKAACEUF5DRVWX","bundle":"https://pith.science/pith/MC3UFFSFQBF3TKAACEUF5DRVWX/bundle.json","state":"https://pith.science/pith/MC3UFFSFQBF3TKAACEUF5DRVWX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MC3UFFSFQBF3TKAACEUF5DRVWX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:MC3UFFSFQBF3TKAACEUF5DRVWX","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":"c6ffc71e1cdd2beca9034469827693c13343ce3f83d8dcf80ac05dae139683d0","cross_cats_sorted":["cs.CG","cs.NI"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2024-12-10T23:06:32Z","title_canon_sha256":"4d43284e6078700c6de630bd4c7d3b8254fed09845ac33ef262636a727144866"},"schema_version":"1.0","source":{"id":"2412.07964","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2412.07964","created_at":"2026-07-05T09:50:37Z"},{"alias_kind":"arxiv_version","alias_value":"2412.07964v2","created_at":"2026-07-05T09:50:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2412.07964","created_at":"2026-07-05T09:50:37Z"},{"alias_kind":"pith_short_12","alias_value":"MC3UFFSFQBF3","created_at":"2026-07-05T09:50:37Z"},{"alias_kind":"pith_short_16","alias_value":"MC3UFFSFQBF3TKAA","created_at":"2026-07-05T09:50:37Z"},{"alias_kind":"pith_short_8","alias_value":"MC3UFFSF","created_at":"2026-07-05T09:50:37Z"}],"graph_snapshots":[{"event_id":"sha256:f2eb93322d48b11677056c37394fe149ba8902bf832fb9eadfcb1b7f920e7a0e","target":"graph","created_at":"2026-07-05T09:50:37Z","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":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2412.07964/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Delay Tolerant Networking (DTN) aims to address a myriad of significant networking challenges that appear in time-varying settings, such as mobile and satellite networks, wherein changes in network topology are frequent and often subject to environmental constraints. Within this paradigm, routing problems are often solved by extending classical graph-theoretic path finding algorithms, such as the Bellman-Ford or Floyd-Warshall algorithms, to the time-varying setting; such extensions are simple to understand, but they have strict optimality criteria and can exhibit non-polynomial scaling. Ackno","authors_text":"Matt Piekenbrock","cross_cats":["cs.CG","cs.NI"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2024-12-10T23:06:32Z","title":"Geometry helps in routing scalability"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2412.07964","kind":"arxiv","version":2},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:2366850efefe69ef3c29ec2047e9ddffbac73021c2633ff194d5df5a5f4c4467","target":"record","created_at":"2026-07-05T09:50:37Z","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":"c6ffc71e1cdd2beca9034469827693c13343ce3f83d8dcf80ac05dae139683d0","cross_cats_sorted":["cs.CG","cs.NI"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2024-12-10T23:06:32Z","title_canon_sha256":"4d43284e6078700c6de630bd4c7d3b8254fed09845ac33ef262636a727144866"},"schema_version":"1.0","source":{"id":"2412.07964","kind":"arxiv","version":2}},"canonical_sha256":"60b7429645804bb9a80011285e8e35b5df141cc09a26d2d6c73759d2097c8789","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"60b7429645804bb9a80011285e8e35b5df141cc09a26d2d6c73759d2097c8789","first_computed_at":"2026-07-05T09:50:37.013303Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T09:50:37.013303Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"UMndTCMztISc5eahAzJQ2ayS6BImbX3FHR7U9VEKi5A2kn+0viYn+ZUPeKfHP5PtMEzp91s+42P7n2VDBub/DA==","signature_status":"signed_v1","signed_at":"2026-07-05T09:50:37.013862Z","signed_message":"canonical_sha256_bytes"},"source_id":"2412.07964","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2366850efefe69ef3c29ec2047e9ddffbac73021c2633ff194d5df5a5f4c4467","sha256:f2eb93322d48b11677056c37394fe149ba8902bf832fb9eadfcb1b7f920e7a0e"],"state_sha256":"6f74a281c265afae7fe9f7af037455e8536796f767b0a0fec4292159c39826d2"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"h1st40yfVhMKYn1FqQt0PEcCK4oppCU9lcmS5CzogGUO9j09JkTeWcA5DIbSRHOTbpmSrtd4c4wGjNFpf1GcCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-06T21:49:10.873244Z","bundle_sha256":"516804ccd330d020f2878a165ae7d69f033523269705198f735093a1f65c9180"}}