{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:YVSVOH6TTW3WRXOCDQ2PLEDZUK","short_pith_number":"pith:YVSVOH6T","canonical_record":{"source":{"id":"1611.01210","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-11-03T22:27:57Z","cross_cats_sorted":[],"title_canon_sha256":"14117869bb13dafda940a4abbae3b3155f498a54b78c93fcc8e3081c2766c4ab","abstract_canon_sha256":"c28830ebb1580f9951a0cd620200a85eeb818d4687979c274143434462f6a6ea"},"schema_version":"1.0"},"canonical_sha256":"c565571fd39db768ddc21c34f59079a296cee0bd50b6f48dbcacc2ef68feab47","source":{"kind":"arxiv","id":"1611.01210","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1611.01210","created_at":"2026-05-18T01:00:11Z"},{"alias_kind":"arxiv_version","alias_value":"1611.01210v1","created_at":"2026-05-18T01:00:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.01210","created_at":"2026-05-18T01:00:11Z"},{"alias_kind":"pith_short_12","alias_value":"YVSVOH6TTW3W","created_at":"2026-05-18T12:30:53Z"},{"alias_kind":"pith_short_16","alias_value":"YVSVOH6TTW3WRXOC","created_at":"2026-05-18T12:30:53Z"},{"alias_kind":"pith_short_8","alias_value":"YVSVOH6T","created_at":"2026-05-18T12:30:53Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:YVSVOH6TTW3WRXOCDQ2PLEDZUK","target":"record","payload":{"canonical_record":{"source":{"id":"1611.01210","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-11-03T22:27:57Z","cross_cats_sorted":[],"title_canon_sha256":"14117869bb13dafda940a4abbae3b3155f498a54b78c93fcc8e3081c2766c4ab","abstract_canon_sha256":"c28830ebb1580f9951a0cd620200a85eeb818d4687979c274143434462f6a6ea"},"schema_version":"1.0"},"canonical_sha256":"c565571fd39db768ddc21c34f59079a296cee0bd50b6f48dbcacc2ef68feab47","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:00:11.688043Z","signature_b64":"jP/+Lq95Na1xemt80o+6Z7QRyCagOctKvupf8GQIVwiC5WeaK5b9DXPSPiXY00BKCquvpTGkRQM8We3ZcqcKBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c565571fd39db768ddc21c34f59079a296cee0bd50b6f48dbcacc2ef68feab47","last_reissued_at":"2026-05-18T01:00:11.687340Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:00:11.687340Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1611.01210","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:00:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lCKfNFZBz/JL5C9PQw8tk13cZD2XWfqV6OY0ZOcwTmJBAvcHbVvmyUKsGVDraAkt4Rz09l6GZUs3y3j7KGcnAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-29T19:01:18.747846Z"},"content_sha256":"f0da3df872158f0a92ebb41ade6f76fa50f795ddeccd114b5268ae8415082b7d","schema_version":"1.0","event_id":"sha256:f0da3df872158f0a92ebb41ade6f76fa50f795ddeccd114b5268ae8415082b7d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:YVSVOH6TTW3WRXOCDQ2PLEDZUK","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Near-Optimal Disjoint-Path Facility Location Through Set Cover by Pairs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"David S. Johnson, Howard Karloff, Ilias Diakonikolas, Lee Breslau, Mauricio G. C. Resende, MohammadTaghi Hajiaghayi, Nick Duffield, Subhabrata Sen, Yu Gu","submitted_at":"2016-11-03T22:27:57Z","abstract_excerpt":"In this paper we consider two special cases of the \"cover-by-pairs\" optimization problem that arise when we need to place facilities so that each customer is served by two facilities that reach it by disjoint shortest paths. These problems arise in a network traffic monitoring scheme proposed by Breslau et al. and have potential applications to content distribution. The \"set-disjoint\" variant applies to networks that use the OSPF routing protocol, and the \"path-disjoint\" variant applies when MPLS routing is enabled, making better solutions possible at the cost of greater operational expense. A"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.01210","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:00:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RNLMMuR8iS5Hh7OnNKVMR4IEuyu+cHofePMyCK8lNaZNUGNUhorKrApZHCjYeokdinAbPFfMQuNMwPgvHW8IDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-29T19:01:18.748483Z"},"content_sha256":"49abed9d0b36d00e48813df1ba991a3e2e34b472726f822ca83e02a8fd772152","schema_version":"1.0","event_id":"sha256:49abed9d0b36d00e48813df1ba991a3e2e34b472726f822ca83e02a8fd772152"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/YVSVOH6TTW3WRXOCDQ2PLEDZUK/bundle.json","state_url":"https://pith.science/pith/YVSVOH6TTW3WRXOCDQ2PLEDZUK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/YVSVOH6TTW3WRXOCDQ2PLEDZUK/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-29T19:01:18Z","links":{"resolver":"https://pith.science/pith/YVSVOH6TTW3WRXOCDQ2PLEDZUK","bundle":"https://pith.science/pith/YVSVOH6TTW3WRXOCDQ2PLEDZUK/bundle.json","state":"https://pith.science/pith/YVSVOH6TTW3WRXOCDQ2PLEDZUK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/YVSVOH6TTW3WRXOCDQ2PLEDZUK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:YVSVOH6TTW3WRXOCDQ2PLEDZUK","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":"c28830ebb1580f9951a0cd620200a85eeb818d4687979c274143434462f6a6ea","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-11-03T22:27:57Z","title_canon_sha256":"14117869bb13dafda940a4abbae3b3155f498a54b78c93fcc8e3081c2766c4ab"},"schema_version":"1.0","source":{"id":"1611.01210","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1611.01210","created_at":"2026-05-18T01:00:11Z"},{"alias_kind":"arxiv_version","alias_value":"1611.01210v1","created_at":"2026-05-18T01:00:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.01210","created_at":"2026-05-18T01:00:11Z"},{"alias_kind":"pith_short_12","alias_value":"YVSVOH6TTW3W","created_at":"2026-05-18T12:30:53Z"},{"alias_kind":"pith_short_16","alias_value":"YVSVOH6TTW3WRXOC","created_at":"2026-05-18T12:30:53Z"},{"alias_kind":"pith_short_8","alias_value":"YVSVOH6T","created_at":"2026-05-18T12:30:53Z"}],"graph_snapshots":[{"event_id":"sha256:49abed9d0b36d00e48813df1ba991a3e2e34b472726f822ca83e02a8fd772152","target":"graph","created_at":"2026-05-18T01:00:11Z","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":"In this paper we consider two special cases of the \"cover-by-pairs\" optimization problem that arise when we need to place facilities so that each customer is served by two facilities that reach it by disjoint shortest paths. These problems arise in a network traffic monitoring scheme proposed by Breslau et al. and have potential applications to content distribution. The \"set-disjoint\" variant applies to networks that use the OSPF routing protocol, and the \"path-disjoint\" variant applies when MPLS routing is enabled, making better solutions possible at the cost of greater operational expense. A","authors_text":"David S. Johnson, Howard Karloff, Ilias Diakonikolas, Lee Breslau, Mauricio G. C. Resende, MohammadTaghi Hajiaghayi, Nick Duffield, Subhabrata Sen, Yu Gu","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-11-03T22:27:57Z","title":"Near-Optimal Disjoint-Path Facility Location Through Set Cover by Pairs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.01210","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:f0da3df872158f0a92ebb41ade6f76fa50f795ddeccd114b5268ae8415082b7d","target":"record","created_at":"2026-05-18T01:00:11Z","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":"c28830ebb1580f9951a0cd620200a85eeb818d4687979c274143434462f6a6ea","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-11-03T22:27:57Z","title_canon_sha256":"14117869bb13dafda940a4abbae3b3155f498a54b78c93fcc8e3081c2766c4ab"},"schema_version":"1.0","source":{"id":"1611.01210","kind":"arxiv","version":1}},"canonical_sha256":"c565571fd39db768ddc21c34f59079a296cee0bd50b6f48dbcacc2ef68feab47","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c565571fd39db768ddc21c34f59079a296cee0bd50b6f48dbcacc2ef68feab47","first_computed_at":"2026-05-18T01:00:11.687340Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:00:11.687340Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"jP/+Lq95Na1xemt80o+6Z7QRyCagOctKvupf8GQIVwiC5WeaK5b9DXPSPiXY00BKCquvpTGkRQM8We3ZcqcKBA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:00:11.688043Z","signed_message":"canonical_sha256_bytes"},"source_id":"1611.01210","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f0da3df872158f0a92ebb41ade6f76fa50f795ddeccd114b5268ae8415082b7d","sha256:49abed9d0b36d00e48813df1ba991a3e2e34b472726f822ca83e02a8fd772152"],"state_sha256":"6721239c4de1954a423505bac1a082e62a708dfc269256738c47ffd99f92b068"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qNbgJ/CAd+EPTdxZsLpUX6353JkrbAKxNpVHCQbkpdZZ3neDHgcBn1JArM17I0JKLja8f45G65nTRdwC+bM6DA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-29T19:01:18.751830Z","bundle_sha256":"92e5a69faf846d85e00aa2d749a7129ee7c7919b8775271805e878e97d6dc00d"}}