{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:XX2VPVG34CET35PO5DWPMDOSRP","short_pith_number":"pith:XX2VPVG3","canonical_record":{"source":{"id":"1607.08041","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-07-27T11:24:30Z","cross_cats_sorted":[],"title_canon_sha256":"dc6e2fa72a9677c933e2f744e6926928f33016aa4190dbc7104382239495bd0c","abstract_canon_sha256":"502e8383da2f69a2a50be1e58a2d9cbf1b32bd5627b6c5b95e3dd282690efda1"},"schema_version":"1.0"},"canonical_sha256":"bdf557d4dbe0893df5eee8ecf60dd28bddff9f32e442be689103675fd84d552d","source":{"kind":"arxiv","id":"1607.08041","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1607.08041","created_at":"2026-05-18T01:10:22Z"},{"alias_kind":"arxiv_version","alias_value":"1607.08041v1","created_at":"2026-05-18T01:10:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.08041","created_at":"2026-05-18T01:10:22Z"},{"alias_kind":"pith_short_12","alias_value":"XX2VPVG34CET","created_at":"2026-05-18T12:30:51Z"},{"alias_kind":"pith_short_16","alias_value":"XX2VPVG34CET35PO","created_at":"2026-05-18T12:30:51Z"},{"alias_kind":"pith_short_8","alias_value":"XX2VPVG3","created_at":"2026-05-18T12:30:51Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:XX2VPVG34CET35PO5DWPMDOSRP","target":"record","payload":{"canonical_record":{"source":{"id":"1607.08041","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-07-27T11:24:30Z","cross_cats_sorted":[],"title_canon_sha256":"dc6e2fa72a9677c933e2f744e6926928f33016aa4190dbc7104382239495bd0c","abstract_canon_sha256":"502e8383da2f69a2a50be1e58a2d9cbf1b32bd5627b6c5b95e3dd282690efda1"},"schema_version":"1.0"},"canonical_sha256":"bdf557d4dbe0893df5eee8ecf60dd28bddff9f32e442be689103675fd84d552d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:10:22.620045Z","signature_b64":"3WgCU1QUBkR7dXHLR1D4m+/Dy3a2yZukoKh2Km8L+iqmUwZQHdtgh+/igwtFxuFoBrfFOr51QkCxcfJaBF9QBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bdf557d4dbe0893df5eee8ecf60dd28bddff9f32e442be689103675fd84d552d","last_reissued_at":"2026-05-18T01:10:22.619505Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:10:22.619505Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1607.08041","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:10:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vnmPrcruuBngk1V5ZD+gVjpx/qr2bYH424X5MUrq+qRzt1Yf5LJQgbqN1GaMsARElSMSYTnJc4nC7bw63oJEAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T14:04:02.711847Z"},"content_sha256":"11b27b348b839467e0bb841bd8c0954b65a4592f7e7412f674822e6802251918","schema_version":"1.0","event_id":"sha256:11b27b348b839467e0bb841bd8c0954b65a4592f7e7412f674822e6802251918"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:XX2VPVG34CET35PO5DWPMDOSRP","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Minmax Tree Facility Location and Sink Evacuation with Dynamic Confluent Flows","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Di Chen, Mordecai Golin","submitted_at":"2016-07-27T11:24:30Z","abstract_excerpt":"Let $G=(V,E)$ be a graph modelling a building or road network in which edges have-both travel times (lengths) and capacities associated with them. An edge's capacity is the number of people that can enter that edge in a unit of time.\n  In emergencies, people evacuate towards the exits. If too many people try to evacuate through the same edge, congestion builds up and slows down the evacuation.\n  Graphs with both lengths and capacities are known as Dynamic Flow networks. An evacuation plan for $G$ consists of a choice of exit locations and a partition of the people at the vertices into groups, "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1607.08041","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:10:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"g4BH6peHeUpzntzBjTCoJolevpyOFVDQUkS6iqSU/eCDGOb1qZtdDHUryfn3xLSqEPIb5ljzwIIg5U5/NTzGDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T14:04:02.712476Z"},"content_sha256":"65d749589ad6533f7fa5f3d40c7c5bde98f3fcbddbe1f7b173da99e1e07e7128","schema_version":"1.0","event_id":"sha256:65d749589ad6533f7fa5f3d40c7c5bde98f3fcbddbe1f7b173da99e1e07e7128"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/XX2VPVG34CET35PO5DWPMDOSRP/bundle.json","state_url":"https://pith.science/pith/XX2VPVG34CET35PO5DWPMDOSRP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/XX2VPVG34CET35PO5DWPMDOSRP/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-07T14:04:02Z","links":{"resolver":"https://pith.science/pith/XX2VPVG34CET35PO5DWPMDOSRP","bundle":"https://pith.science/pith/XX2VPVG34CET35PO5DWPMDOSRP/bundle.json","state":"https://pith.science/pith/XX2VPVG34CET35PO5DWPMDOSRP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/XX2VPVG34CET35PO5DWPMDOSRP/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:XX2VPVG34CET35PO5DWPMDOSRP","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":"502e8383da2f69a2a50be1e58a2d9cbf1b32bd5627b6c5b95e3dd282690efda1","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-07-27T11:24:30Z","title_canon_sha256":"dc6e2fa72a9677c933e2f744e6926928f33016aa4190dbc7104382239495bd0c"},"schema_version":"1.0","source":{"id":"1607.08041","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1607.08041","created_at":"2026-05-18T01:10:22Z"},{"alias_kind":"arxiv_version","alias_value":"1607.08041v1","created_at":"2026-05-18T01:10:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.08041","created_at":"2026-05-18T01:10:22Z"},{"alias_kind":"pith_short_12","alias_value":"XX2VPVG34CET","created_at":"2026-05-18T12:30:51Z"},{"alias_kind":"pith_short_16","alias_value":"XX2VPVG34CET35PO","created_at":"2026-05-18T12:30:51Z"},{"alias_kind":"pith_short_8","alias_value":"XX2VPVG3","created_at":"2026-05-18T12:30:51Z"}],"graph_snapshots":[{"event_id":"sha256:65d749589ad6533f7fa5f3d40c7c5bde98f3fcbddbe1f7b173da99e1e07e7128","target":"graph","created_at":"2026-05-18T01:10:22Z","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":"Let $G=(V,E)$ be a graph modelling a building or road network in which edges have-both travel times (lengths) and capacities associated with them. An edge's capacity is the number of people that can enter that edge in a unit of time.\n  In emergencies, people evacuate towards the exits. If too many people try to evacuate through the same edge, congestion builds up and slows down the evacuation.\n  Graphs with both lengths and capacities are known as Dynamic Flow networks. An evacuation plan for $G$ consists of a choice of exit locations and a partition of the people at the vertices into groups, ","authors_text":"Di Chen, Mordecai Golin","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-07-27T11:24:30Z","title":"Minmax Tree Facility Location and Sink Evacuation with Dynamic Confluent Flows"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1607.08041","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:11b27b348b839467e0bb841bd8c0954b65a4592f7e7412f674822e6802251918","target":"record","created_at":"2026-05-18T01:10:22Z","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":"502e8383da2f69a2a50be1e58a2d9cbf1b32bd5627b6c5b95e3dd282690efda1","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-07-27T11:24:30Z","title_canon_sha256":"dc6e2fa72a9677c933e2f744e6926928f33016aa4190dbc7104382239495bd0c"},"schema_version":"1.0","source":{"id":"1607.08041","kind":"arxiv","version":1}},"canonical_sha256":"bdf557d4dbe0893df5eee8ecf60dd28bddff9f32e442be689103675fd84d552d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"bdf557d4dbe0893df5eee8ecf60dd28bddff9f32e442be689103675fd84d552d","first_computed_at":"2026-05-18T01:10:22.619505Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:10:22.619505Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"3WgCU1QUBkR7dXHLR1D4m+/Dy3a2yZukoKh2Km8L+iqmUwZQHdtgh+/igwtFxuFoBrfFOr51QkCxcfJaBF9QBA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:10:22.620045Z","signed_message":"canonical_sha256_bytes"},"source_id":"1607.08041","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:11b27b348b839467e0bb841bd8c0954b65a4592f7e7412f674822e6802251918","sha256:65d749589ad6533f7fa5f3d40c7c5bde98f3fcbddbe1f7b173da99e1e07e7128"],"state_sha256":"59b706dd0cf13d8eb9d665b8e07105be7a5a00da11f4b1afbf27fa06b88e2a4b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"d1N7ThH/ETksAo0Mcw8ZZgogj2H2eHVVHofBvxQc/gODBIivn/7I8CyQ8vws+S9yYzAF5F8NcxlAZfcBQ6OmBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-07T14:04:02.716026Z","bundle_sha256":"5389506ad375a739c45a578bd39e9c1f7e043e620e9d7ce532c6d536dc4c2df4"}}