{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:66B5W3JIVHVU6NMHR4IN2MZKUJ","short_pith_number":"pith:66B5W3JI","canonical_record":{"source":{"id":"1908.05700","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2019-08-15T18:31:16Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"0f7e32b091e3bcc380665ee0efb1bc0bf9339290d583e042c80ff7fde93e9a82","abstract_canon_sha256":"280b3d13a9b3c44443e4d85ae9de7a0108bcb2eb9f80fed28a5f4d0a0ceca222"},"schema_version":"1.0"},"canonical_sha256":"f783db6d28a9eb4f35878f10dd332aa27c805d1cfe52cfccc15bbded512afdda","source":{"kind":"arxiv","id":"1908.05700","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1908.05700","created_at":"2026-07-04T23:57:52Z"},{"alias_kind":"arxiv_version","alias_value":"1908.05700v1","created_at":"2026-07-04T23:57:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.05700","created_at":"2026-07-04T23:57:52Z"},{"alias_kind":"pith_short_12","alias_value":"66B5W3JIVHVU","created_at":"2026-07-04T23:57:52Z"},{"alias_kind":"pith_short_16","alias_value":"66B5W3JIVHVU6NMH","created_at":"2026-07-04T23:57:52Z"},{"alias_kind":"pith_short_8","alias_value":"66B5W3JI","created_at":"2026-07-04T23:57:52Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:66B5W3JIVHVU6NMHR4IN2MZKUJ","target":"record","payload":{"canonical_record":{"source":{"id":"1908.05700","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2019-08-15T18:31:16Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"0f7e32b091e3bcc380665ee0efb1bc0bf9339290d583e042c80ff7fde93e9a82","abstract_canon_sha256":"280b3d13a9b3c44443e4d85ae9de7a0108bcb2eb9f80fed28a5f4d0a0ceca222"},"schema_version":"1.0"},"canonical_sha256":"f783db6d28a9eb4f35878f10dd332aa27c805d1cfe52cfccc15bbded512afdda","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T23:57:52.501352Z","signature_b64":"sRuyNajDWqO7O84WI2uiPvmAdAx2bPwDCqZjJoZtZO1sQEG/jc8n+Uo33ALcDw9OA4XD40rS3enldFv9RwfQCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f783db6d28a9eb4f35878f10dd332aa27c805d1cfe52cfccc15bbded512afdda","last_reissued_at":"2026-07-04T23:57:52.500985Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T23:57:52.500985Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1908.05700","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-07-04T23:57:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RcdduXlgnLKBO0IoO9zycl+UTrc1bFe/kJjBUFFhKSZlAIhFXpy9nl4huA5XObhCORlSH7Egzf+T1me7mv6LBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-16T05:51:51.830051Z"},"content_sha256":"f5b2c3ea417adfa3e3a86f7cfef281d190e69605add18e82cf3006cc8e5851e2","schema_version":"1.0","event_id":"sha256:f5b2c3ea417adfa3e3a86f7cfef281d190e69605add18e82cf3006cc8e5851e2"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:66B5W3JIVHVU6NMHR4IN2MZKUJ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Distributed Backup Placement in One Round and its Applications to Maximum Matching Approximation and Self-Stabilization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.DC","authors_text":"Gal Oren, Leonid Barenboim","submitted_at":"2019-08-15T18:31:16Z","abstract_excerpt":"In the distributed backup-placement problem each node of a network has to select one neighbor, such that the maximum number of nodes that make the same selection is minimized. This is a natural relaxation of the perfect matching problem, in which each node is selected just by one neighbor. Previous (approximate) solutions for backup placement are non-trivial, even for simple graph topologies, such as dense graphs. In this paper we devise an algorithm for dense graph topologies, including unit disk graphs, unit ball graphs, line graphs, graphs with bounded diversity, and many more. Our algorith"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1908.05700","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1908.05700/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-04T23:57:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NRFDNQUnN5Fgd9Nyi698plckiZ77jwrDl9oU5uCfYnTk/mmEYsHapNgsdzX0Ltm5YBlujEUKZlMtu2dmLsbQDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-16T05:51:51.830794Z"},"content_sha256":"3151fbf4607fa4b719d8acea607ba023eb9ef74be46b582defba21db50555413","schema_version":"1.0","event_id":"sha256:3151fbf4607fa4b719d8acea607ba023eb9ef74be46b582defba21db50555413"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/66B5W3JIVHVU6NMHR4IN2MZKUJ/bundle.json","state_url":"https://pith.science/pith/66B5W3JIVHVU6NMHR4IN2MZKUJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/66B5W3JIVHVU6NMHR4IN2MZKUJ/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-08-16T05:51:51Z","links":{"resolver":"https://pith.science/pith/66B5W3JIVHVU6NMHR4IN2MZKUJ","bundle":"https://pith.science/pith/66B5W3JIVHVU6NMHR4IN2MZKUJ/bundle.json","state":"https://pith.science/pith/66B5W3JIVHVU6NMHR4IN2MZKUJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/66B5W3JIVHVU6NMHR4IN2MZKUJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:66B5W3JIVHVU6NMHR4IN2MZKUJ","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":"280b3d13a9b3c44443e4d85ae9de7a0108bcb2eb9f80fed28a5f4d0a0ceca222","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2019-08-15T18:31:16Z","title_canon_sha256":"0f7e32b091e3bcc380665ee0efb1bc0bf9339290d583e042c80ff7fde93e9a82"},"schema_version":"1.0","source":{"id":"1908.05700","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1908.05700","created_at":"2026-07-04T23:57:52Z"},{"alias_kind":"arxiv_version","alias_value":"1908.05700v1","created_at":"2026-07-04T23:57:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.05700","created_at":"2026-07-04T23:57:52Z"},{"alias_kind":"pith_short_12","alias_value":"66B5W3JIVHVU","created_at":"2026-07-04T23:57:52Z"},{"alias_kind":"pith_short_16","alias_value":"66B5W3JIVHVU6NMH","created_at":"2026-07-04T23:57:52Z"},{"alias_kind":"pith_short_8","alias_value":"66B5W3JI","created_at":"2026-07-04T23:57:52Z"}],"graph_snapshots":[{"event_id":"sha256:3151fbf4607fa4b719d8acea607ba023eb9ef74be46b582defba21db50555413","target":"graph","created_at":"2026-07-04T23:57:52Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/1908.05700/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"In the distributed backup-placement problem each node of a network has to select one neighbor, such that the maximum number of nodes that make the same selection is minimized. This is a natural relaxation of the perfect matching problem, in which each node is selected just by one neighbor. Previous (approximate) solutions for backup placement are non-trivial, even for simple graph topologies, such as dense graphs. In this paper we devise an algorithm for dense graph topologies, including unit disk graphs, unit ball graphs, line graphs, graphs with bounded diversity, and many more. Our algorith","authors_text":"Gal Oren, Leonid Barenboim","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2019-08-15T18:31:16Z","title":"Distributed Backup Placement in One Round and its Applications to Maximum Matching Approximation and Self-Stabilization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1908.05700","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:f5b2c3ea417adfa3e3a86f7cfef281d190e69605add18e82cf3006cc8e5851e2","target":"record","created_at":"2026-07-04T23:57:52Z","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":"280b3d13a9b3c44443e4d85ae9de7a0108bcb2eb9f80fed28a5f4d0a0ceca222","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2019-08-15T18:31:16Z","title_canon_sha256":"0f7e32b091e3bcc380665ee0efb1bc0bf9339290d583e042c80ff7fde93e9a82"},"schema_version":"1.0","source":{"id":"1908.05700","kind":"arxiv","version":1}},"canonical_sha256":"f783db6d28a9eb4f35878f10dd332aa27c805d1cfe52cfccc15bbded512afdda","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f783db6d28a9eb4f35878f10dd332aa27c805d1cfe52cfccc15bbded512afdda","first_computed_at":"2026-07-04T23:57:52.500985Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-04T23:57:52.500985Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"sRuyNajDWqO7O84WI2uiPvmAdAx2bPwDCqZjJoZtZO1sQEG/jc8n+Uo33ALcDw9OA4XD40rS3enldFv9RwfQCw==","signature_status":"signed_v1","signed_at":"2026-07-04T23:57:52.501352Z","signed_message":"canonical_sha256_bytes"},"source_id":"1908.05700","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f5b2c3ea417adfa3e3a86f7cfef281d190e69605add18e82cf3006cc8e5851e2","sha256:3151fbf4607fa4b719d8acea607ba023eb9ef74be46b582defba21db50555413"],"state_sha256":"e0b3ae33b8306f2c9fe10dac9cf0d69160bf46fca2c47e9b5c3181a6d489f615"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MHosmRocZjbIuPJ1LoI5HGOvsYExKtNKqr+3IKvpM1z8tCqbP+RBaKMC5ZtEahHD8KAL21Nlw9b1YsBR9C6nAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-16T05:51:51.836590Z","bundle_sha256":"bb23652018ddefe81234fcd454abf44f89129b54a3df104d06bd26eb7c07b9de"}}