{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:OAUIKV66TY5ZVZIYFTCZG56446","short_pith_number":"pith:OAUIKV66","canonical_record":{"source":{"id":"1505.03537","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"physics.soc-ph","submitted_at":"2015-05-13T20:02:17Z","cross_cats_sorted":["cond-mat.dis-nn","cs.DM","cs.DS"],"title_canon_sha256":"112b81b375b59cd1cf95ba5d48bf2e6e302b6edde14feb2550742eaa67a61117","abstract_canon_sha256":"c18f9490c387e8c6a4693b0a312882f842d8fbd052f68c65d0f13a39426dcac3"},"schema_version":"1.0"},"canonical_sha256":"70288557de9e3b9ae5182cc59377dce7a9f231f7a759014379cbaaa8bfeedd05","source":{"kind":"arxiv","id":"1505.03537","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1505.03537","created_at":"2026-05-18T01:20:46Z"},{"alias_kind":"arxiv_version","alias_value":"1505.03537v1","created_at":"2026-05-18T01:20:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1505.03537","created_at":"2026-05-18T01:20:46Z"},{"alias_kind":"pith_short_12","alias_value":"OAUIKV66TY5Z","created_at":"2026-05-18T12:29:34Z"},{"alias_kind":"pith_short_16","alias_value":"OAUIKV66TY5ZVZIY","created_at":"2026-05-18T12:29:34Z"},{"alias_kind":"pith_short_8","alias_value":"OAUIKV66","created_at":"2026-05-18T12:29:34Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:OAUIKV66TY5ZVZIYFTCZG56446","target":"record","payload":{"canonical_record":{"source":{"id":"1505.03537","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"physics.soc-ph","submitted_at":"2015-05-13T20:02:17Z","cross_cats_sorted":["cond-mat.dis-nn","cs.DM","cs.DS"],"title_canon_sha256":"112b81b375b59cd1cf95ba5d48bf2e6e302b6edde14feb2550742eaa67a61117","abstract_canon_sha256":"c18f9490c387e8c6a4693b0a312882f842d8fbd052f68c65d0f13a39426dcac3"},"schema_version":"1.0"},"canonical_sha256":"70288557de9e3b9ae5182cc59377dce7a9f231f7a759014379cbaaa8bfeedd05","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:20:46.378527Z","signature_b64":"QvEosl8v3Al/Or/rQt3pyFeFaigmHXP+HfxMjXdCrRv4/absw0sVU+JbDJtgzMUGfHTaFbepQJzQSq4IIFWTCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"70288557de9e3b9ae5182cc59377dce7a9f231f7a759014379cbaaa8bfeedd05","last_reissued_at":"2026-05-18T01:20:46.378112Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:20:46.378112Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1505.03537","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:20:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sFOSxqU7oatoVkrKVPN1t23kA4CIfk0JN2/4TD0kBxpso/dvsFNm64Ah7ROI0eS6anMzUuFZX7QTclguVTn6Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T19:23:49.089000Z"},"content_sha256":"8d0d0c351dd00a502e036bccded80c527e6c322c60656885a43afa1e4134b233","schema_version":"1.0","event_id":"sha256:8d0d0c351dd00a502e036bccded80c527e6c322c60656885a43afa1e4134b233"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:OAUIKV66TY5ZVZIYFTCZG56446","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The Directed Dominating Set Problem: Generalized Leaf Removal and Belief Propagation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cond-mat.dis-nn","cs.DM","cs.DS"],"primary_cat":"physics.soc-ph","authors_text":"Hai-Jun Zhou, Jin-Hua Zhao, Yusupjan Habibulla","submitted_at":"2015-05-13T20:02:17Z","abstract_excerpt":"A minimum dominating set for a digraph (directed graph) is a smallest set of vertices such that each vertex either belongs to this set or has at least one parent vertex in this set. We solve this hard combinatorial optimization problem approximately by a local algorithm of generalized leaf removal and by a message-passing algorithm of belief propagation. These algorithms can construct near-optimal dominating sets or even exact minimum dominating sets for random digraphs and also for real-world digraph instances. We further develop a core percolation theory and a replica-symmetric spin glass th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1505.03537","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:20:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8G6Q2XL+ryiBRYu/GVQR75VVBcVSrSXJ+Rp5TlsIj7GvnRnvht6tX3FDd79ZN/37zheGNQc9Cv22waf6qV03BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T19:23:49.089669Z"},"content_sha256":"8c57bfd2c78f0b616950547293b17ec37aeb1cf3d7e85f0cc8bb182a996c4604","schema_version":"1.0","event_id":"sha256:8c57bfd2c78f0b616950547293b17ec37aeb1cf3d7e85f0cc8bb182a996c4604"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OAUIKV66TY5ZVZIYFTCZG56446/bundle.json","state_url":"https://pith.science/pith/OAUIKV66TY5ZVZIYFTCZG56446/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OAUIKV66TY5ZVZIYFTCZG56446/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-08T19:23:49Z","links":{"resolver":"https://pith.science/pith/OAUIKV66TY5ZVZIYFTCZG56446","bundle":"https://pith.science/pith/OAUIKV66TY5ZVZIYFTCZG56446/bundle.json","state":"https://pith.science/pith/OAUIKV66TY5ZVZIYFTCZG56446/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OAUIKV66TY5ZVZIYFTCZG56446/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:OAUIKV66TY5ZVZIYFTCZG56446","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":"c18f9490c387e8c6a4693b0a312882f842d8fbd052f68c65d0f13a39426dcac3","cross_cats_sorted":["cond-mat.dis-nn","cs.DM","cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"physics.soc-ph","submitted_at":"2015-05-13T20:02:17Z","title_canon_sha256":"112b81b375b59cd1cf95ba5d48bf2e6e302b6edde14feb2550742eaa67a61117"},"schema_version":"1.0","source":{"id":"1505.03537","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1505.03537","created_at":"2026-05-18T01:20:46Z"},{"alias_kind":"arxiv_version","alias_value":"1505.03537v1","created_at":"2026-05-18T01:20:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1505.03537","created_at":"2026-05-18T01:20:46Z"},{"alias_kind":"pith_short_12","alias_value":"OAUIKV66TY5Z","created_at":"2026-05-18T12:29:34Z"},{"alias_kind":"pith_short_16","alias_value":"OAUIKV66TY5ZVZIY","created_at":"2026-05-18T12:29:34Z"},{"alias_kind":"pith_short_8","alias_value":"OAUIKV66","created_at":"2026-05-18T12:29:34Z"}],"graph_snapshots":[{"event_id":"sha256:8c57bfd2c78f0b616950547293b17ec37aeb1cf3d7e85f0cc8bb182a996c4604","target":"graph","created_at":"2026-05-18T01:20:46Z","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 minimum dominating set for a digraph (directed graph) is a smallest set of vertices such that each vertex either belongs to this set or has at least one parent vertex in this set. We solve this hard combinatorial optimization problem approximately by a local algorithm of generalized leaf removal and by a message-passing algorithm of belief propagation. These algorithms can construct near-optimal dominating sets or even exact minimum dominating sets for random digraphs and also for real-world digraph instances. We further develop a core percolation theory and a replica-symmetric spin glass th","authors_text":"Hai-Jun Zhou, Jin-Hua Zhao, Yusupjan Habibulla","cross_cats":["cond-mat.dis-nn","cs.DM","cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"physics.soc-ph","submitted_at":"2015-05-13T20:02:17Z","title":"The Directed Dominating Set Problem: Generalized Leaf Removal and Belief Propagation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1505.03537","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:8d0d0c351dd00a502e036bccded80c527e6c322c60656885a43afa1e4134b233","target":"record","created_at":"2026-05-18T01:20:46Z","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":"c18f9490c387e8c6a4693b0a312882f842d8fbd052f68c65d0f13a39426dcac3","cross_cats_sorted":["cond-mat.dis-nn","cs.DM","cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"physics.soc-ph","submitted_at":"2015-05-13T20:02:17Z","title_canon_sha256":"112b81b375b59cd1cf95ba5d48bf2e6e302b6edde14feb2550742eaa67a61117"},"schema_version":"1.0","source":{"id":"1505.03537","kind":"arxiv","version":1}},"canonical_sha256":"70288557de9e3b9ae5182cc59377dce7a9f231f7a759014379cbaaa8bfeedd05","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"70288557de9e3b9ae5182cc59377dce7a9f231f7a759014379cbaaa8bfeedd05","first_computed_at":"2026-05-18T01:20:46.378112Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:20:46.378112Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"QvEosl8v3Al/Or/rQt3pyFeFaigmHXP+HfxMjXdCrRv4/absw0sVU+JbDJtgzMUGfHTaFbepQJzQSq4IIFWTCA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:20:46.378527Z","signed_message":"canonical_sha256_bytes"},"source_id":"1505.03537","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8d0d0c351dd00a502e036bccded80c527e6c322c60656885a43afa1e4134b233","sha256:8c57bfd2c78f0b616950547293b17ec37aeb1cf3d7e85f0cc8bb182a996c4604"],"state_sha256":"884e22209a330553c1d8d305b847fb9b7b5a0a9abbeb39962aeb4b236fac8c5d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XmudhG+fma3dHWI8WwZ/Vrcqsr76RlmqKPteGMpaa7zlu0NdSJuN2z1edG2YpEeMepFNHF8fYj42czXUTowfAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-08T19:23:49.093077Z","bundle_sha256":"2019c39306530ba9f563928c97b3663953a5145633f5c1663f23c9dc02463cc1"}}