{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:ZC4O7GKOQOCCPYVWSJAVTJE7BW","short_pith_number":"pith:ZC4O7GKO","canonical_record":{"source":{"id":"1202.0082","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-02-01T02:19:46Z","cross_cats_sorted":[],"title_canon_sha256":"dcd1ca39116fd72a338053e97fbfc7ab9e03a590a5c78c76a68a387331e1a7e2","abstract_canon_sha256":"ba55a798c644721ce03f003843cd4824d1ff0ed662942f7f1a8d9b1556082e5a"},"schema_version":"1.0"},"canonical_sha256":"c8b8ef994e838427e2b6924159a49f0da33dc2f564ed1e7e1f282aad5f4d82cc","source":{"kind":"arxiv","id":"1202.0082","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1202.0082","created_at":"2026-05-18T04:03:20Z"},{"alias_kind":"arxiv_version","alias_value":"1202.0082v1","created_at":"2026-05-18T04:03:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1202.0082","created_at":"2026-05-18T04:03:20Z"},{"alias_kind":"pith_short_12","alias_value":"ZC4O7GKOQOCC","created_at":"2026-05-18T12:27:30Z"},{"alias_kind":"pith_short_16","alias_value":"ZC4O7GKOQOCCPYVW","created_at":"2026-05-18T12:27:30Z"},{"alias_kind":"pith_short_8","alias_value":"ZC4O7GKO","created_at":"2026-05-18T12:27:30Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:ZC4O7GKOQOCCPYVWSJAVTJE7BW","target":"record","payload":{"canonical_record":{"source":{"id":"1202.0082","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-02-01T02:19:46Z","cross_cats_sorted":[],"title_canon_sha256":"dcd1ca39116fd72a338053e97fbfc7ab9e03a590a5c78c76a68a387331e1a7e2","abstract_canon_sha256":"ba55a798c644721ce03f003843cd4824d1ff0ed662942f7f1a8d9b1556082e5a"},"schema_version":"1.0"},"canonical_sha256":"c8b8ef994e838427e2b6924159a49f0da33dc2f564ed1e7e1f282aad5f4d82cc","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:03:20.560453Z","signature_b64":"VtGldRPetY76LxkSpJJBf/y7PAizZlpfMzKxqFYGbvsAr8HhKgn0jcUng8tbDR/hOj9N3HDKilKCUq7qhLkvDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c8b8ef994e838427e2b6924159a49f0da33dc2f564ed1e7e1f282aad5f4d82cc","last_reissued_at":"2026-05-18T04:03:20.560032Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:03:20.560032Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1202.0082","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-18T04:03:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vYtWSufF5NfwXtShuzhAFEkoEHOQsJXZRR0JGUX6rVVeh9Iv6Be1ERhHzMFjre7syCE8Su5VFUCOgXgxOFvCCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-20T06:25:19.662600Z"},"content_sha256":"ce1ce4e72c0703e006d431a1be6fd222b17b1d40cc857f6c8f1b5d1f4cd2455f","schema_version":"1.0","event_id":"sha256:ce1ce4e72c0703e006d431a1be6fd222b17b1d40cc857f6c8f1b5d1f4cd2455f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:ZC4O7GKOQOCCPYVWSJAVTJE7BW","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Dynamic Shortest Path Algorithms for Hypergraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Amotz Bar-Noy, Ananthram Swami, Jianhang Gao, Qing Zhao, Ram Ramanathan, Wei Ren","submitted_at":"2012-02-01T02:19:46Z","abstract_excerpt":"A hypergraph is a set V of vertices and a set of non-empty subsets of V, called hyperedges. Unlike graphs, hypergraphs can capture higher-order interactions in social and communication networks that go beyond a simple union of pairwise relationships. In this paper, we consider the shortest path problem in hypergraphs. We develop two algorithms for finding and maintaining the shortest hyperpaths in a dynamic network with both weight and topological changes. These two algorithms are the first to address the fully dynamic shortest path problem in a general hypergraph. They complement each other b"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1202.0082","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-18T04:03:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FNQLUdZvdleU+UrRnOsEfIBMPeLm1SeN0rfpZguzF1F2H8in3X5QO/ORXSfoUNZk2E9aBBH/r8PPeTcPReErCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-20T06:25:19.662950Z"},"content_sha256":"67a0fd8d0c3da9b5e0f905180ad7904d1c354937d08e6d008ef3e2c05f118535","schema_version":"1.0","event_id":"sha256:67a0fd8d0c3da9b5e0f905180ad7904d1c354937d08e6d008ef3e2c05f118535"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZC4O7GKOQOCCPYVWSJAVTJE7BW/bundle.json","state_url":"https://pith.science/pith/ZC4O7GKOQOCCPYVWSJAVTJE7BW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZC4O7GKOQOCCPYVWSJAVTJE7BW/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-05-20T06:25:19Z","links":{"resolver":"https://pith.science/pith/ZC4O7GKOQOCCPYVWSJAVTJE7BW","bundle":"https://pith.science/pith/ZC4O7GKOQOCCPYVWSJAVTJE7BW/bundle.json","state":"https://pith.science/pith/ZC4O7GKOQOCCPYVWSJAVTJE7BW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZC4O7GKOQOCCPYVWSJAVTJE7BW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:ZC4O7GKOQOCCPYVWSJAVTJE7BW","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":"ba55a798c644721ce03f003843cd4824d1ff0ed662942f7f1a8d9b1556082e5a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-02-01T02:19:46Z","title_canon_sha256":"dcd1ca39116fd72a338053e97fbfc7ab9e03a590a5c78c76a68a387331e1a7e2"},"schema_version":"1.0","source":{"id":"1202.0082","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1202.0082","created_at":"2026-05-18T04:03:20Z"},{"alias_kind":"arxiv_version","alias_value":"1202.0082v1","created_at":"2026-05-18T04:03:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1202.0082","created_at":"2026-05-18T04:03:20Z"},{"alias_kind":"pith_short_12","alias_value":"ZC4O7GKOQOCC","created_at":"2026-05-18T12:27:30Z"},{"alias_kind":"pith_short_16","alias_value":"ZC4O7GKOQOCCPYVW","created_at":"2026-05-18T12:27:30Z"},{"alias_kind":"pith_short_8","alias_value":"ZC4O7GKO","created_at":"2026-05-18T12:27:30Z"}],"graph_snapshots":[{"event_id":"sha256:67a0fd8d0c3da9b5e0f905180ad7904d1c354937d08e6d008ef3e2c05f118535","target":"graph","created_at":"2026-05-18T04:03:20Z","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 hypergraph is a set V of vertices and a set of non-empty subsets of V, called hyperedges. Unlike graphs, hypergraphs can capture higher-order interactions in social and communication networks that go beyond a simple union of pairwise relationships. In this paper, we consider the shortest path problem in hypergraphs. We develop two algorithms for finding and maintaining the shortest hyperpaths in a dynamic network with both weight and topological changes. These two algorithms are the first to address the fully dynamic shortest path problem in a general hypergraph. They complement each other b","authors_text":"Amotz Bar-Noy, Ananthram Swami, Jianhang Gao, Qing Zhao, Ram Ramanathan, Wei Ren","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-02-01T02:19:46Z","title":"Dynamic Shortest Path Algorithms for Hypergraphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1202.0082","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:ce1ce4e72c0703e006d431a1be6fd222b17b1d40cc857f6c8f1b5d1f4cd2455f","target":"record","created_at":"2026-05-18T04:03:20Z","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":"ba55a798c644721ce03f003843cd4824d1ff0ed662942f7f1a8d9b1556082e5a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-02-01T02:19:46Z","title_canon_sha256":"dcd1ca39116fd72a338053e97fbfc7ab9e03a590a5c78c76a68a387331e1a7e2"},"schema_version":"1.0","source":{"id":"1202.0082","kind":"arxiv","version":1}},"canonical_sha256":"c8b8ef994e838427e2b6924159a49f0da33dc2f564ed1e7e1f282aad5f4d82cc","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c8b8ef994e838427e2b6924159a49f0da33dc2f564ed1e7e1f282aad5f4d82cc","first_computed_at":"2026-05-18T04:03:20.560032Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:03:20.560032Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"VtGldRPetY76LxkSpJJBf/y7PAizZlpfMzKxqFYGbvsAr8HhKgn0jcUng8tbDR/hOj9N3HDKilKCUq7qhLkvDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T04:03:20.560453Z","signed_message":"canonical_sha256_bytes"},"source_id":"1202.0082","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ce1ce4e72c0703e006d431a1be6fd222b17b1d40cc857f6c8f1b5d1f4cd2455f","sha256:67a0fd8d0c3da9b5e0f905180ad7904d1c354937d08e6d008ef3e2c05f118535"],"state_sha256":"7fdb717733e4398e8e2dc27a57d2decbe36db89f4a12e8185cfca9fde9d2847d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eRtc67mKtFqqkfck40o8VOouVQ5IeikKjJA/t7pKRXXSbb7e+ZsxIAoeOBrrXAuYs2wkTIZuIDn29q2JpHc3Bw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-20T06:25:19.665020Z","bundle_sha256":"832ce8e7349d3e616284889259cda9eece323425a1eca7a54ae5b8776efac2ea"}}