{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:F6TGJTKSH6WEWK7CPOFKUK7ZGJ","short_pith_number":"pith:F6TGJTKS","canonical_record":{"source":{"id":"1602.02991","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2016-02-09T14:17:55Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"01cfa8ac58203fec26778dcb029d2b36c4dc2e3a9e26e7334a5e4a659b1e03fa","abstract_canon_sha256":"0d6bdf4ae0818da2f982a399780dd686b1d3235b1aeed5b100ca47fac32b5148"},"schema_version":"1.0"},"canonical_sha256":"2fa664cd523fac4b2be27b8aaa2bf9326f584cb0385be0d8573f72970ecb95fe","source":{"kind":"arxiv","id":"1602.02991","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1602.02991","created_at":"2026-05-18T01:20:55Z"},{"alias_kind":"arxiv_version","alias_value":"1602.02991v2","created_at":"2026-05-18T01:20:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.02991","created_at":"2026-05-18T01:20:55Z"},{"alias_kind":"pith_short_12","alias_value":"F6TGJTKSH6WE","created_at":"2026-05-18T12:30:15Z"},{"alias_kind":"pith_short_16","alias_value":"F6TGJTKSH6WEWK7C","created_at":"2026-05-18T12:30:15Z"},{"alias_kind":"pith_short_8","alias_value":"F6TGJTKS","created_at":"2026-05-18T12:30:15Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:F6TGJTKSH6WEWK7CPOFKUK7ZGJ","target":"record","payload":{"canonical_record":{"source":{"id":"1602.02991","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2016-02-09T14:17:55Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"01cfa8ac58203fec26778dcb029d2b36c4dc2e3a9e26e7334a5e4a659b1e03fa","abstract_canon_sha256":"0d6bdf4ae0818da2f982a399780dd686b1d3235b1aeed5b100ca47fac32b5148"},"schema_version":"1.0"},"canonical_sha256":"2fa664cd523fac4b2be27b8aaa2bf9326f584cb0385be0d8573f72970ecb95fe","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:20:55.318295Z","signature_b64":"KK4llD47B/KAZqPftoFFU5sGk9DDtLfTmBinWj/K9tfwV5MxaVLEy/JskdApa3OrkxiXFsSdp/U0epwKTFkZAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2fa664cd523fac4b2be27b8aaa2bf9326f584cb0385be0d8573f72970ecb95fe","last_reissued_at":"2026-05-18T01:20:55.317587Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:20:55.317587Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1602.02991","source_version":2,"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:20:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EjxqNMxEasIOIdp19nz1gami0DIiDJGkSow7K7VNMK4b9+8AM3IKZMtOHXo6P1SPaiKseVmptf9JwXRPBCEfCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T18:43:42.613278Z"},"content_sha256":"fa83deb21e53c66c03a0d9fd4168c083a9a5f8ab8b3aa8655bab648ce40d0c09","schema_version":"1.0","event_id":"sha256:fa83deb21e53c66c03a0d9fd4168c083a9a5f8ab8b3aa8655bab648ce40d0c09"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:F6TGJTKSH6WEWK7CPOFKUK7ZGJ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A local constant factor approximation for the minimum dominating set problem on bounded genus graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.DC","authors_text":"Saeed Akhoondian Amiri, Sebastian Siebertz, Stefan Schmid","submitted_at":"2016-02-09T14:17:55Z","abstract_excerpt":"The Minimum Dominating Set (MDS) problem is not only one of the most fundamental problems in distributed computing, it is also one of the most challenging ones. While it is well-known that minimum dominating sets cannot be approximated locally on general graphs, over the last years, several breakthroughs have been made on computing local approximations on sparse graphs.\n  This paper presents a deterministic and local constant factor approximation for minimum dominating sets on bounded genus graphs, a very large family of sparse graphs. Our main technical contribution is a new analysis of a sli"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.02991","kind":"arxiv","version":2},"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:20:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZaN8yqNpcc6OvUn10npSfAnC38vFXvpTjkJtjwNt6wUoakU+PaMB8tnnO+BtYP8J/DPuMXyNTMYD46Yyd+sTDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T18:43:42.613961Z"},"content_sha256":"37552c3bc782abbae314c21414808889d27198424aede3b2228d14ebe907b282","schema_version":"1.0","event_id":"sha256:37552c3bc782abbae314c21414808889d27198424aede3b2228d14ebe907b282"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/F6TGJTKSH6WEWK7CPOFKUK7ZGJ/bundle.json","state_url":"https://pith.science/pith/F6TGJTKSH6WEWK7CPOFKUK7ZGJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/F6TGJTKSH6WEWK7CPOFKUK7ZGJ/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-25T18:43:42Z","links":{"resolver":"https://pith.science/pith/F6TGJTKSH6WEWK7CPOFKUK7ZGJ","bundle":"https://pith.science/pith/F6TGJTKSH6WEWK7CPOFKUK7ZGJ/bundle.json","state":"https://pith.science/pith/F6TGJTKSH6WEWK7CPOFKUK7ZGJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/F6TGJTKSH6WEWK7CPOFKUK7ZGJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:F6TGJTKSH6WEWK7CPOFKUK7ZGJ","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":"0d6bdf4ae0818da2f982a399780dd686b1d3235b1aeed5b100ca47fac32b5148","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2016-02-09T14:17:55Z","title_canon_sha256":"01cfa8ac58203fec26778dcb029d2b36c4dc2e3a9e26e7334a5e4a659b1e03fa"},"schema_version":"1.0","source":{"id":"1602.02991","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1602.02991","created_at":"2026-05-18T01:20:55Z"},{"alias_kind":"arxiv_version","alias_value":"1602.02991v2","created_at":"2026-05-18T01:20:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.02991","created_at":"2026-05-18T01:20:55Z"},{"alias_kind":"pith_short_12","alias_value":"F6TGJTKSH6WE","created_at":"2026-05-18T12:30:15Z"},{"alias_kind":"pith_short_16","alias_value":"F6TGJTKSH6WEWK7C","created_at":"2026-05-18T12:30:15Z"},{"alias_kind":"pith_short_8","alias_value":"F6TGJTKS","created_at":"2026-05-18T12:30:15Z"}],"graph_snapshots":[{"event_id":"sha256:37552c3bc782abbae314c21414808889d27198424aede3b2228d14ebe907b282","target":"graph","created_at":"2026-05-18T01:20:55Z","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":"The Minimum Dominating Set (MDS) problem is not only one of the most fundamental problems in distributed computing, it is also one of the most challenging ones. While it is well-known that minimum dominating sets cannot be approximated locally on general graphs, over the last years, several breakthroughs have been made on computing local approximations on sparse graphs.\n  This paper presents a deterministic and local constant factor approximation for minimum dominating sets on bounded genus graphs, a very large family of sparse graphs. Our main technical contribution is a new analysis of a sli","authors_text":"Saeed Akhoondian Amiri, Sebastian Siebertz, Stefan Schmid","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2016-02-09T14:17:55Z","title":"A local constant factor approximation for the minimum dominating set problem on bounded genus graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.02991","kind":"arxiv","version":2},"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:fa83deb21e53c66c03a0d9fd4168c083a9a5f8ab8b3aa8655bab648ce40d0c09","target":"record","created_at":"2026-05-18T01:20:55Z","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":"0d6bdf4ae0818da2f982a399780dd686b1d3235b1aeed5b100ca47fac32b5148","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2016-02-09T14:17:55Z","title_canon_sha256":"01cfa8ac58203fec26778dcb029d2b36c4dc2e3a9e26e7334a5e4a659b1e03fa"},"schema_version":"1.0","source":{"id":"1602.02991","kind":"arxiv","version":2}},"canonical_sha256":"2fa664cd523fac4b2be27b8aaa2bf9326f584cb0385be0d8573f72970ecb95fe","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2fa664cd523fac4b2be27b8aaa2bf9326f584cb0385be0d8573f72970ecb95fe","first_computed_at":"2026-05-18T01:20:55.317587Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:20:55.317587Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"KK4llD47B/KAZqPftoFFU5sGk9DDtLfTmBinWj/K9tfwV5MxaVLEy/JskdApa3OrkxiXFsSdp/U0epwKTFkZAg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:20:55.318295Z","signed_message":"canonical_sha256_bytes"},"source_id":"1602.02991","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:fa83deb21e53c66c03a0d9fd4168c083a9a5f8ab8b3aa8655bab648ce40d0c09","sha256:37552c3bc782abbae314c21414808889d27198424aede3b2228d14ebe907b282"],"state_sha256":"6d2248f948ef793db53844c98817d3df0d340c7b4cc5e34930a05f986cb4dda3"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Ba4SwIgrxy+5xBH9X4IFcPFQILfgpYVgA6S+YyYBgV5mLxeADZssS3qRqikNAbZY42+0Ai30edi7tRXn4LwnBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T18:43:42.617808Z","bundle_sha256":"079bcccf00b5139a310fa52bbe1b6f165703980691ea72e16ef537de3e81a6d6"}}