{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:SEQRI32UBWPA4SYD3SU4ELNXQN","short_pith_number":"pith:SEQRI32U","schema_version":"1.0","canonical_sha256":"9121146f540d9e0e4b03dca9c22db78375592b3143f5d408971c3bb634fd198e","source":{"kind":"arxiv","id":"1703.09023","version":1},"attestation_state":"computed","paper":{"title":"Domination number and minimum dominating sets in pseudofractal scale-free web and Sierpi\\'nski graph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.SI","authors_text":"Huan Li, Liren Shan, Zhongzhi Zhang","submitted_at":"2017-03-27T12:09:50Z","abstract_excerpt":"The minimum dominating set (MDS) problem is a fundamental subject of theoretical computer science, and has found vast applications in different areas, including sensor networks, protein interaction networks, and structural controllability. However, the determination of the size of a MDS and the number of all MDSs in a general network is NP-hard, and it thus makes sense to seek particular graphs for which the MDS problem can be solved analytically. In this paper, we study the MDS problem in the pseudofractal scale-free web and the Sierpi\\'nski graph, which have the same number of vertices and e"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1703.09023","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2017-03-27T12:09:50Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"e60bb0a9863ee440957305a05bf2bc2dacdb2609b4d775b1283bb8aee1b66b6a","abstract_canon_sha256":"94a949ab5ec4a99215feaf9d717460450f5ca30b1418faff5795316433adb61a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:47:54.533116Z","signature_b64":"I+nnOz30vLmvFGc219pu1FdjWs2E5bBpEg+TEnskqmeHwsLnsyXUoEkmOeeLMLU/3mNw+F/I4RJjlfNS101bAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9121146f540d9e0e4b03dca9c22db78375592b3143f5d408971c3bb634fd198e","last_reissued_at":"2026-05-18T00:47:54.532458Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:47:54.532458Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Domination number and minimum dominating sets in pseudofractal scale-free web and Sierpi\\'nski graph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.SI","authors_text":"Huan Li, Liren Shan, Zhongzhi Zhang","submitted_at":"2017-03-27T12:09:50Z","abstract_excerpt":"The minimum dominating set (MDS) problem is a fundamental subject of theoretical computer science, and has found vast applications in different areas, including sensor networks, protein interaction networks, and structural controllability. However, the determination of the size of a MDS and the number of all MDSs in a general network is NP-hard, and it thus makes sense to seek particular graphs for which the MDS problem can be solved analytically. In this paper, we study the MDS problem in the pseudofractal scale-free web and the Sierpi\\'nski graph, which have the same number of vertices and e"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.09023","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1703.09023","created_at":"2026-05-18T00:47:54.532565+00:00"},{"alias_kind":"arxiv_version","alias_value":"1703.09023v1","created_at":"2026-05-18T00:47:54.532565+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.09023","created_at":"2026-05-18T00:47:54.532565+00:00"},{"alias_kind":"pith_short_12","alias_value":"SEQRI32UBWPA","created_at":"2026-05-18T12:31:43.269735+00:00"},{"alias_kind":"pith_short_16","alias_value":"SEQRI32UBWPA4SYD","created_at":"2026-05-18T12:31:43.269735+00:00"},{"alias_kind":"pith_short_8","alias_value":"SEQRI32U","created_at":"2026-05-18T12:31:43.269735+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/SEQRI32UBWPA4SYD3SU4ELNXQN","json":"https://pith.science/pith/SEQRI32UBWPA4SYD3SU4ELNXQN.json","graph_json":"https://pith.science/api/pith-number/SEQRI32UBWPA4SYD3SU4ELNXQN/graph.json","events_json":"https://pith.science/api/pith-number/SEQRI32UBWPA4SYD3SU4ELNXQN/events.json","paper":"https://pith.science/paper/SEQRI32U"},"agent_actions":{"view_html":"https://pith.science/pith/SEQRI32UBWPA4SYD3SU4ELNXQN","download_json":"https://pith.science/pith/SEQRI32UBWPA4SYD3SU4ELNXQN.json","view_paper":"https://pith.science/paper/SEQRI32U","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1703.09023&json=true","fetch_graph":"https://pith.science/api/pith-number/SEQRI32UBWPA4SYD3SU4ELNXQN/graph.json","fetch_events":"https://pith.science/api/pith-number/SEQRI32UBWPA4SYD3SU4ELNXQN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SEQRI32UBWPA4SYD3SU4ELNXQN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SEQRI32UBWPA4SYD3SU4ELNXQN/action/storage_attestation","attest_author":"https://pith.science/pith/SEQRI32UBWPA4SYD3SU4ELNXQN/action/author_attestation","sign_citation":"https://pith.science/pith/SEQRI32UBWPA4SYD3SU4ELNXQN/action/citation_signature","submit_replication":"https://pith.science/pith/SEQRI32UBWPA4SYD3SU4ELNXQN/action/replication_record"}},"created_at":"2026-05-18T00:47:54.532565+00:00","updated_at":"2026-05-18T00:47:54.532565+00:00"}