{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:XWDBJR7XVSCWHVL5JUG3NL2WTS","short_pith_number":"pith:XWDBJR7X","canonical_record":{"source":{"id":"1404.5448","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-04-22T10:18:29Z","cross_cats_sorted":["cs.CG"],"title_canon_sha256":"3ea535bd7b459162e4b8d16aaa268d9b1a712e89a91f325b4db79434f97784f7","abstract_canon_sha256":"d74db9e17460ab83f3a30d79190567bf99f3b262b62067b3ac04f3f47199e5c6"},"schema_version":"1.0"},"canonical_sha256":"bd8614c7f7ac8563d57d4d0db6af569ca4e583458a196ceafab268f550b11fc3","source":{"kind":"arxiv","id":"1404.5448","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1404.5448","created_at":"2026-05-18T02:53:31Z"},{"alias_kind":"arxiv_version","alias_value":"1404.5448v1","created_at":"2026-05-18T02:53:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1404.5448","created_at":"2026-05-18T02:53:31Z"},{"alias_kind":"pith_short_12","alias_value":"XWDBJR7XVSCW","created_at":"2026-05-18T12:28:57Z"},{"alias_kind":"pith_short_16","alias_value":"XWDBJR7XVSCWHVL5","created_at":"2026-05-18T12:28:57Z"},{"alias_kind":"pith_short_8","alias_value":"XWDBJR7X","created_at":"2026-05-18T12:28:57Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:XWDBJR7XVSCWHVL5JUG3NL2WTS","target":"record","payload":{"canonical_record":{"source":{"id":"1404.5448","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-04-22T10:18:29Z","cross_cats_sorted":["cs.CG"],"title_canon_sha256":"3ea535bd7b459162e4b8d16aaa268d9b1a712e89a91f325b4db79434f97784f7","abstract_canon_sha256":"d74db9e17460ab83f3a30d79190567bf99f3b262b62067b3ac04f3f47199e5c6"},"schema_version":"1.0"},"canonical_sha256":"bd8614c7f7ac8563d57d4d0db6af569ca4e583458a196ceafab268f550b11fc3","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:53:31.406760Z","signature_b64":"kt5dxnoRMjTyaQON1YTWJyMSJrOzE81/uPd8q7bjLJ9YkR3KF7y8u5ylVzeSZi+L7cSho9kMePpuoHhapIlFAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bd8614c7f7ac8563d57d4d0db6af569ca4e583458a196ceafab268f550b11fc3","last_reissued_at":"2026-05-18T02:53:31.405962Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:53:31.405962Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1404.5448","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-18T02:53:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VHtJU2K1Hv9wCQyzmqSY7oTj9N/EwoHlEBpwK5vnHnOQIDP58VXsq8o1his7lekVGP8TNDhRaqE+y+i1T9TiCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T19:39:14.640139Z"},"content_sha256":"6cd714399e8089a705af51aa44dca6ae2b6cbf0222d4733594edb9a1deee1936","schema_version":"1.0","event_id":"sha256:6cd714399e8089a705af51aa44dca6ae2b6cbf0222d4733594edb9a1deee1936"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:XWDBJR7XVSCWHVL5JUG3NL2WTS","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Polynomial Time Algorithm for Minimax-Regret Evacuation on a Dynamic Path","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CG"],"primary_cat":"cs.DS","authors_text":"Guru Prakash Arumugam, John Augustine, Mordecai J. Golin, Prashanth Srikanthan","submitted_at":"2014-04-22T10:18:29Z","abstract_excerpt":"A dynamic path network is an undirected path with evacuees situated at each vertex. To evacuate the path, evacuees travel towards a designated sink (doorway) to exit. Each edge has a capacity, the number of evacuees that can enter the edge in unit time. Congestion occurs if an evacuee has to wait at a vertex for other evacuees to leave first. The basic problem is to place k sinks on the line, with an associated evacuation strategy, so as to minimize the total time needed to evacuate everyone. The minmax-regret version introduces uncertainty into the input, with the number of evacuees at vertic"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1404.5448","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-18T02:53:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JoCqOX88uniCaUo1YS7TE0cmjJfwhG0APhJWrCnOu/+w7JoxsoYdy1MCuA6xwk8rvVanep93p+7rPH5SjxvuBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T19:39:14.640495Z"},"content_sha256":"59835c27e87f520dd1cff1f294c008c7a84517ba88377aa65c316e7446925a08","schema_version":"1.0","event_id":"sha256:59835c27e87f520dd1cff1f294c008c7a84517ba88377aa65c316e7446925a08"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/XWDBJR7XVSCWHVL5JUG3NL2WTS/bundle.json","state_url":"https://pith.science/pith/XWDBJR7XVSCWHVL5JUG3NL2WTS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/XWDBJR7XVSCWHVL5JUG3NL2WTS/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-01T19:39:14Z","links":{"resolver":"https://pith.science/pith/XWDBJR7XVSCWHVL5JUG3NL2WTS","bundle":"https://pith.science/pith/XWDBJR7XVSCWHVL5JUG3NL2WTS/bundle.json","state":"https://pith.science/pith/XWDBJR7XVSCWHVL5JUG3NL2WTS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/XWDBJR7XVSCWHVL5JUG3NL2WTS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:XWDBJR7XVSCWHVL5JUG3NL2WTS","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":"d74db9e17460ab83f3a30d79190567bf99f3b262b62067b3ac04f3f47199e5c6","cross_cats_sorted":["cs.CG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-04-22T10:18:29Z","title_canon_sha256":"3ea535bd7b459162e4b8d16aaa268d9b1a712e89a91f325b4db79434f97784f7"},"schema_version":"1.0","source":{"id":"1404.5448","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1404.5448","created_at":"2026-05-18T02:53:31Z"},{"alias_kind":"arxiv_version","alias_value":"1404.5448v1","created_at":"2026-05-18T02:53:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1404.5448","created_at":"2026-05-18T02:53:31Z"},{"alias_kind":"pith_short_12","alias_value":"XWDBJR7XVSCW","created_at":"2026-05-18T12:28:57Z"},{"alias_kind":"pith_short_16","alias_value":"XWDBJR7XVSCWHVL5","created_at":"2026-05-18T12:28:57Z"},{"alias_kind":"pith_short_8","alias_value":"XWDBJR7X","created_at":"2026-05-18T12:28:57Z"}],"graph_snapshots":[{"event_id":"sha256:59835c27e87f520dd1cff1f294c008c7a84517ba88377aa65c316e7446925a08","target":"graph","created_at":"2026-05-18T02:53:31Z","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":"A dynamic path network is an undirected path with evacuees situated at each vertex. To evacuate the path, evacuees travel towards a designated sink (doorway) to exit. Each edge has a capacity, the number of evacuees that can enter the edge in unit time. Congestion occurs if an evacuee has to wait at a vertex for other evacuees to leave first. The basic problem is to place k sinks on the line, with an associated evacuation strategy, so as to minimize the total time needed to evacuate everyone. The minmax-regret version introduces uncertainty into the input, with the number of evacuees at vertic","authors_text":"Guru Prakash Arumugam, John Augustine, Mordecai J. Golin, Prashanth Srikanthan","cross_cats":["cs.CG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-04-22T10:18:29Z","title":"A Polynomial Time Algorithm for Minimax-Regret Evacuation on a Dynamic Path"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1404.5448","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:6cd714399e8089a705af51aa44dca6ae2b6cbf0222d4733594edb9a1deee1936","target":"record","created_at":"2026-05-18T02:53:31Z","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":"d74db9e17460ab83f3a30d79190567bf99f3b262b62067b3ac04f3f47199e5c6","cross_cats_sorted":["cs.CG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-04-22T10:18:29Z","title_canon_sha256":"3ea535bd7b459162e4b8d16aaa268d9b1a712e89a91f325b4db79434f97784f7"},"schema_version":"1.0","source":{"id":"1404.5448","kind":"arxiv","version":1}},"canonical_sha256":"bd8614c7f7ac8563d57d4d0db6af569ca4e583458a196ceafab268f550b11fc3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"bd8614c7f7ac8563d57d4d0db6af569ca4e583458a196ceafab268f550b11fc3","first_computed_at":"2026-05-18T02:53:31.405962Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:53:31.405962Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"kt5dxnoRMjTyaQON1YTWJyMSJrOzE81/uPd8q7bjLJ9YkR3KF7y8u5ylVzeSZi+L7cSho9kMePpuoHhapIlFAg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:53:31.406760Z","signed_message":"canonical_sha256_bytes"},"source_id":"1404.5448","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6cd714399e8089a705af51aa44dca6ae2b6cbf0222d4733594edb9a1deee1936","sha256:59835c27e87f520dd1cff1f294c008c7a84517ba88377aa65c316e7446925a08"],"state_sha256":"3ab747caff22b775cdd0d8649c7883a2392df3cd277f13d1270a5e743b07fcfb"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sJ2SRkG/JxMzQXQk4Ucfuy8OVRuLcre968DgOt3mUAsjROZogz2tsQI0ikPPv4D2PXPRID1W1XXHlQjvLGdbDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T19:39:14.642448Z","bundle_sha256":"a707777ecd4b736fd8bf25bec3e30230fb1450b9f9e0c11c25df2219220ce7e3"}}