{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:2V5PH57Q4HZJ6G4VVSI7N4FJ7Z","short_pith_number":"pith:2V5PH57Q","canonical_record":{"source":{"id":"1512.03115","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-12-10T00:09:52Z","cross_cats_sorted":[],"title_canon_sha256":"653401b4750cab8ba3e6733804f098320bd71bafe21d76f8345c56b67076eb4a","abstract_canon_sha256":"76f5642f4017b8c9235fe152f1deb6c729323dcf799094b6b8aeffd3a7165687"},"schema_version":"1.0"},"canonical_sha256":"d57af3f7f0e1f29f1b95ac91f6f0a9fe46e0fd52e28a6fc710b68721c5997755","source":{"kind":"arxiv","id":"1512.03115","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1512.03115","created_at":"2026-05-18T01:24:37Z"},{"alias_kind":"arxiv_version","alias_value":"1512.03115v1","created_at":"2026-05-18T01:24:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1512.03115","created_at":"2026-05-18T01:24:37Z"},{"alias_kind":"pith_short_12","alias_value":"2V5PH57Q4HZJ","created_at":"2026-05-18T12:29:02Z"},{"alias_kind":"pith_short_16","alias_value":"2V5PH57Q4HZJ6G4V","created_at":"2026-05-18T12:29:02Z"},{"alias_kind":"pith_short_8","alias_value":"2V5PH57Q","created_at":"2026-05-18T12:29:02Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:2V5PH57Q4HZJ6G4VVSI7N4FJ7Z","target":"record","payload":{"canonical_record":{"source":{"id":"1512.03115","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-12-10T00:09:52Z","cross_cats_sorted":[],"title_canon_sha256":"653401b4750cab8ba3e6733804f098320bd71bafe21d76f8345c56b67076eb4a","abstract_canon_sha256":"76f5642f4017b8c9235fe152f1deb6c729323dcf799094b6b8aeffd3a7165687"},"schema_version":"1.0"},"canonical_sha256":"d57af3f7f0e1f29f1b95ac91f6f0a9fe46e0fd52e28a6fc710b68721c5997755","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:24:37.856731Z","signature_b64":"8NQuL4twpLRZJXX3urkAxgsktLNP6r2sGzsp5FlRXaQylvq8WOCJieuXHef4HNRzW+nFjJNCcozCycTRdDVfAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d57af3f7f0e1f29f1b95ac91f6f0a9fe46e0fd52e28a6fc710b68721c5997755","last_reissued_at":"2026-05-18T01:24:37.856291Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:24:37.856291Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1512.03115","source_version":1,"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-05-18T01:24:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aN8CU0ffBP/UfpMucrzfigjgLeow1YnOLycF2eiNI0+gJbt9gPynUbWOOlp7NveVopALCY0O9FuJ7ZIcQCwhBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T16:42:41.863486Z"},"content_sha256":"f85e62e09d4aeeddf0310b4ca5f41c2032bb530eddd739cb783337ba8511be0e","schema_version":"1.0","event_id":"sha256:f85e62e09d4aeeddf0310b4ca5f41c2032bb530eddd739cb783337ba8511be0e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:2V5PH57Q4HZJ6G4VVSI7N4FJ7Z","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Dynamic Geodesics in Treespace via Parametric Maximum Flow","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Scott Provan, Sean Skwerer","submitted_at":"2015-12-10T00:09:52Z","abstract_excerpt":"Shortest paths in treespace, which represent minimal deformations between trees, are unique and can be computed in polynomial time. The ability to quickly compute shortest paths has enabled new approaches for statistical analysis of populations of trees and phylogenetic inference. This paper gives a new algorithm for updating geodesic paths when the end points are dynamic. Such algorithms will be especially useful when optimizing for objectives that are functions of distances from a search point to other points e.g. for finding a tree which has the minimum average distance to a collection of t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1512.03115","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"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-05-18T01:24:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QVWMeI80peTfSWuzFrKorFoitFK52h0XAFB/bIE6XLNH3xJ4o3dZ7+t5zEX1g1BFNDYpyLpOSj/NDnuXfJKJCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T16:42:41.864109Z"},"content_sha256":"dce6d3b375ecb526cd18e87a53f3c2d271315515024d1c772916ac3afdee4bf1","schema_version":"1.0","event_id":"sha256:dce6d3b375ecb526cd18e87a53f3c2d271315515024d1c772916ac3afdee4bf1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/2V5PH57Q4HZJ6G4VVSI7N4FJ7Z/bundle.json","state_url":"https://pith.science/pith/2V5PH57Q4HZJ6G4VVSI7N4FJ7Z/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/2V5PH57Q4HZJ6G4VVSI7N4FJ7Z/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-06T16:42:41Z","links":{"resolver":"https://pith.science/pith/2V5PH57Q4HZJ6G4VVSI7N4FJ7Z","bundle":"https://pith.science/pith/2V5PH57Q4HZJ6G4VVSI7N4FJ7Z/bundle.json","state":"https://pith.science/pith/2V5PH57Q4HZJ6G4VVSI7N4FJ7Z/state.json","well_known_bundle":"https://pith.science/.well-known/pith/2V5PH57Q4HZJ6G4VVSI7N4FJ7Z/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:2V5PH57Q4HZJ6G4VVSI7N4FJ7Z","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":"76f5642f4017b8c9235fe152f1deb6c729323dcf799094b6b8aeffd3a7165687","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-12-10T00:09:52Z","title_canon_sha256":"653401b4750cab8ba3e6733804f098320bd71bafe21d76f8345c56b67076eb4a"},"schema_version":"1.0","source":{"id":"1512.03115","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1512.03115","created_at":"2026-05-18T01:24:37Z"},{"alias_kind":"arxiv_version","alias_value":"1512.03115v1","created_at":"2026-05-18T01:24:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1512.03115","created_at":"2026-05-18T01:24:37Z"},{"alias_kind":"pith_short_12","alias_value":"2V5PH57Q4HZJ","created_at":"2026-05-18T12:29:02Z"},{"alias_kind":"pith_short_16","alias_value":"2V5PH57Q4HZJ6G4V","created_at":"2026-05-18T12:29:02Z"},{"alias_kind":"pith_short_8","alias_value":"2V5PH57Q","created_at":"2026-05-18T12:29:02Z"}],"graph_snapshots":[{"event_id":"sha256:dce6d3b375ecb526cd18e87a53f3c2d271315515024d1c772916ac3afdee4bf1","target":"graph","created_at":"2026-05-18T01:24: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"},"paper":{"abstract_excerpt":"Shortest paths in treespace, which represent minimal deformations between trees, are unique and can be computed in polynomial time. The ability to quickly compute shortest paths has enabled new approaches for statistical analysis of populations of trees and phylogenetic inference. This paper gives a new algorithm for updating geodesic paths when the end points are dynamic. Such algorithms will be especially useful when optimizing for objectives that are functions of distances from a search point to other points e.g. for finding a tree which has the minimum average distance to a collection of t","authors_text":"Scott Provan, Sean Skwerer","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-12-10T00:09:52Z","title":"Dynamic Geodesics in Treespace via Parametric Maximum Flow"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1512.03115","kind":"arxiv","version":1},"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:f85e62e09d4aeeddf0310b4ca5f41c2032bb530eddd739cb783337ba8511be0e","target":"record","created_at":"2026-05-18T01:24: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":"76f5642f4017b8c9235fe152f1deb6c729323dcf799094b6b8aeffd3a7165687","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-12-10T00:09:52Z","title_canon_sha256":"653401b4750cab8ba3e6733804f098320bd71bafe21d76f8345c56b67076eb4a"},"schema_version":"1.0","source":{"id":"1512.03115","kind":"arxiv","version":1}},"canonical_sha256":"d57af3f7f0e1f29f1b95ac91f6f0a9fe46e0fd52e28a6fc710b68721c5997755","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d57af3f7f0e1f29f1b95ac91f6f0a9fe46e0fd52e28a6fc710b68721c5997755","first_computed_at":"2026-05-18T01:24:37.856291Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:24:37.856291Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"8NQuL4twpLRZJXX3urkAxgsktLNP6r2sGzsp5FlRXaQylvq8WOCJieuXHef4HNRzW+nFjJNCcozCycTRdDVfAA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:24:37.856731Z","signed_message":"canonical_sha256_bytes"},"source_id":"1512.03115","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f85e62e09d4aeeddf0310b4ca5f41c2032bb530eddd739cb783337ba8511be0e","sha256:dce6d3b375ecb526cd18e87a53f3c2d271315515024d1c772916ac3afdee4bf1"],"state_sha256":"06a7950843abb3ab302538d356237d796fef583df70bed7a6177674cb2dc59ac"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+xFNkGK9x+H8lhqfJXyHpeqZilNzpKG26xxblM/UBS7DVa5wAIFaWtCCoblQlfMumQNMcV+HY5Vu+3ElyhTqCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-06T16:42:41.867805Z","bundle_sha256":"9f79319c8a17941750393ae612666a71eeaa0f254b285b96b9047e4f3df526f2"}}