{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:UUE2WR3DODRU3LFULPWPL6AKAC","short_pith_number":"pith:UUE2WR3D","canonical_record":{"source":{"id":"1810.11656","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-10-27T14:50:18Z","cross_cats_sorted":[],"title_canon_sha256":"9e9ab882297da2293877aa5c14a16d7a8c70122ac5dca638cad02edb9ed7de05","abstract_canon_sha256":"20056ead58e5f34bb0e07d9a61d01b82023e85180a83ab58a79159e531d1688f"},"schema_version":"1.0"},"canonical_sha256":"a509ab476370e34dacb45becf5f80a0091a9d0ba085709dbc73afb4ff875b6b8","source":{"kind":"arxiv","id":"1810.11656","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1810.11656","created_at":"2026-05-18T00:02:07Z"},{"alias_kind":"arxiv_version","alias_value":"1810.11656v1","created_at":"2026-05-18T00:02:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.11656","created_at":"2026-05-18T00:02:07Z"},{"alias_kind":"pith_short_12","alias_value":"UUE2WR3DODRU","created_at":"2026-05-18T12:32:56Z"},{"alias_kind":"pith_short_16","alias_value":"UUE2WR3DODRU3LFU","created_at":"2026-05-18T12:32:56Z"},{"alias_kind":"pith_short_8","alias_value":"UUE2WR3D","created_at":"2026-05-18T12:32:56Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:UUE2WR3DODRU3LFULPWPL6AKAC","target":"record","payload":{"canonical_record":{"source":{"id":"1810.11656","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-10-27T14:50:18Z","cross_cats_sorted":[],"title_canon_sha256":"9e9ab882297da2293877aa5c14a16d7a8c70122ac5dca638cad02edb9ed7de05","abstract_canon_sha256":"20056ead58e5f34bb0e07d9a61d01b82023e85180a83ab58a79159e531d1688f"},"schema_version":"1.0"},"canonical_sha256":"a509ab476370e34dacb45becf5f80a0091a9d0ba085709dbc73afb4ff875b6b8","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:02:07.851986Z","signature_b64":"TR1MJrGngm6rlQkd965BiyFq9m7bDnmN6wRx1aN11iHH7kuaegkgG0fuPQTzMa9gQVKGBhiRb3R3PsOJyjEyCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a509ab476370e34dacb45becf5f80a0091a9d0ba085709dbc73afb4ff875b6b8","last_reissued_at":"2026-05-18T00:02:07.851393Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:02:07.851393Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1810.11656","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-18T00:02:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bNnNfju2Ght0TyTFb5X9aYbgCUAu/la+d1O3SYiMKltTkmknv8LydLLxfV4PhR8IpyMcZ001r/pkKNtmjJpVDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T01:37:37.726764Z"},"content_sha256":"399d03d2b08fbb72b422496d65d50fdbe0c3e6269191caebec2e3146bf7454ca","schema_version":"1.0","event_id":"sha256:399d03d2b08fbb72b422496d65d50fdbe0c3e6269191caebec2e3146bf7454ca"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:UUE2WR3DODRU3LFULPWPL6AKAC","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Minimizing Branching Vertices in Distance-preserving Subgraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Jaikumar Radhakrishnan, Kshitij Gajjar","submitted_at":"2018-10-27T14:50:18Z","abstract_excerpt":"It is $\\mathsf{NP}$-hard to determine the minimum number of branching vertices needed in a single-source distance-preserving subgraph of an undirected graph. We show that this problem can be solved in polynomial time if the input graph is an interval graph.\n  In earlier work, it was shown that every interval graph with $k$ terminal vertices admits an all-pairs distance-preserving subgraph with $O(k\\log k)$ branching vertices. We consider graphs that can be expressed as the strong product of two interval graphs, and present a polynomial time algorithm that takes such a graph with $k$ terminals "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.11656","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-18T00:02:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KlMPEefkdakoX7TW1QMm88kp5b86tBWFGt/vsF2I71rbOwCvvJ0xYDvezHXft1n6B3A5xk+qDa3VQX+d5vXzCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T01:37:37.727127Z"},"content_sha256":"5569be03ad7bcf0003d74dd4ee130e6755aaa324b0bcb7b33bebe3b08394ecdd","schema_version":"1.0","event_id":"sha256:5569be03ad7bcf0003d74dd4ee130e6755aaa324b0bcb7b33bebe3b08394ecdd"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/UUE2WR3DODRU3LFULPWPL6AKAC/bundle.json","state_url":"https://pith.science/pith/UUE2WR3DODRU3LFULPWPL6AKAC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/UUE2WR3DODRU3LFULPWPL6AKAC/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-05T01:37:37Z","links":{"resolver":"https://pith.science/pith/UUE2WR3DODRU3LFULPWPL6AKAC","bundle":"https://pith.science/pith/UUE2WR3DODRU3LFULPWPL6AKAC/bundle.json","state":"https://pith.science/pith/UUE2WR3DODRU3LFULPWPL6AKAC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/UUE2WR3DODRU3LFULPWPL6AKAC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:UUE2WR3DODRU3LFULPWPL6AKAC","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":"20056ead58e5f34bb0e07d9a61d01b82023e85180a83ab58a79159e531d1688f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-10-27T14:50:18Z","title_canon_sha256":"9e9ab882297da2293877aa5c14a16d7a8c70122ac5dca638cad02edb9ed7de05"},"schema_version":"1.0","source":{"id":"1810.11656","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1810.11656","created_at":"2026-05-18T00:02:07Z"},{"alias_kind":"arxiv_version","alias_value":"1810.11656v1","created_at":"2026-05-18T00:02:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.11656","created_at":"2026-05-18T00:02:07Z"},{"alias_kind":"pith_short_12","alias_value":"UUE2WR3DODRU","created_at":"2026-05-18T12:32:56Z"},{"alias_kind":"pith_short_16","alias_value":"UUE2WR3DODRU3LFU","created_at":"2026-05-18T12:32:56Z"},{"alias_kind":"pith_short_8","alias_value":"UUE2WR3D","created_at":"2026-05-18T12:32:56Z"}],"graph_snapshots":[{"event_id":"sha256:5569be03ad7bcf0003d74dd4ee130e6755aaa324b0bcb7b33bebe3b08394ecdd","target":"graph","created_at":"2026-05-18T00:02:07Z","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":"It is $\\mathsf{NP}$-hard to determine the minimum number of branching vertices needed in a single-source distance-preserving subgraph of an undirected graph. We show that this problem can be solved in polynomial time if the input graph is an interval graph.\n  In earlier work, it was shown that every interval graph with $k$ terminal vertices admits an all-pairs distance-preserving subgraph with $O(k\\log k)$ branching vertices. We consider graphs that can be expressed as the strong product of two interval graphs, and present a polynomial time algorithm that takes such a graph with $k$ terminals ","authors_text":"Jaikumar Radhakrishnan, Kshitij Gajjar","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-10-27T14:50:18Z","title":"Minimizing Branching Vertices in Distance-preserving Subgraphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.11656","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:399d03d2b08fbb72b422496d65d50fdbe0c3e6269191caebec2e3146bf7454ca","target":"record","created_at":"2026-05-18T00:02:07Z","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":"20056ead58e5f34bb0e07d9a61d01b82023e85180a83ab58a79159e531d1688f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-10-27T14:50:18Z","title_canon_sha256":"9e9ab882297da2293877aa5c14a16d7a8c70122ac5dca638cad02edb9ed7de05"},"schema_version":"1.0","source":{"id":"1810.11656","kind":"arxiv","version":1}},"canonical_sha256":"a509ab476370e34dacb45becf5f80a0091a9d0ba085709dbc73afb4ff875b6b8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a509ab476370e34dacb45becf5f80a0091a9d0ba085709dbc73afb4ff875b6b8","first_computed_at":"2026-05-18T00:02:07.851393Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:02:07.851393Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"TR1MJrGngm6rlQkd965BiyFq9m7bDnmN6wRx1aN11iHH7kuaegkgG0fuPQTzMa9gQVKGBhiRb3R3PsOJyjEyCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:02:07.851986Z","signed_message":"canonical_sha256_bytes"},"source_id":"1810.11656","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:399d03d2b08fbb72b422496d65d50fdbe0c3e6269191caebec2e3146bf7454ca","sha256:5569be03ad7bcf0003d74dd4ee130e6755aaa324b0bcb7b33bebe3b08394ecdd"],"state_sha256":"eb4a57632b9145ff0db32620e15a24546808746631d3af6d6882d2b770caa86e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wjK4nhrDlddxfUfPOj1WRL96Bafsgk+QdqnCBdf73sbeqvFb1Sm0aaVjDJJc5/ED9anTdy4HY45W4ZDvKIA/Bg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T01:37:37.730415Z","bundle_sha256":"7c33894e264b60e7a9abc4f20b5608177aaa25fd3a62ef406e19e3c4d931279e"}}