{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:4MQME4LM3QDO42A6UFXYKBEVBX","short_pith_number":"pith:4MQME4LM","schema_version":"1.0","canonical_sha256":"e320c2716cdc06ee681ea16f8504950deb7e76d79d81d78ecd2c7ef3c717fc62","source":{"kind":"arxiv","id":"1302.2518","version":2},"attestation_state":"computed","paper":{"title":"Minimum Dominating Sets in Scale-Free Network Ensembles","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cond-mat.stat-mech","cs.SI"],"primary_cat":"physics.soc-ph","authors_text":"B.K. Szymanski, F. Molnar Jr., G. Korniss, S. Sreenivasan","submitted_at":"2013-02-11T16:06:32Z","abstract_excerpt":"We study the scaling behavior of the size of minimum dominating set (MDS) in scale-free networks, with respect to network size $N$ and power-law exponent $\\gamma$, while keeping the average degree fixed. We study ensembles generated by three different network construction methods, and we use a greedy algorithm to approximate the MDS. With a structural cutoff imposed on the maximal degree ($k_{\\max}=\\sqrt{N}$) we find linear scaling of the MDS size with respect to $N$ in all three network classes. Without any cutoff ($k_{\\max}=N-1$) two of the network classes display a transition at $\\gamma \\ap"},"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":"1302.2518","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"physics.soc-ph","submitted_at":"2013-02-11T16:06:32Z","cross_cats_sorted":["cond-mat.stat-mech","cs.SI"],"title_canon_sha256":"0cbffbc502a88b9e89e138805a98770799e8d4ea0f9287e48f6ef0482cbfc5b4","abstract_canon_sha256":"86c65a57f39c3a684aba727dd9cf6a7b756a766ca988be2439e9e22af1518cb1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:13:33.969382Z","signature_b64":"7QhqVynQzgX341XZ3NAXkB77wqB+3nP9Mc+axZnfBj846AcLh1XY7c5C6+oXgAMyBLiU7xd4rWKTohC5fKa5Bw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e320c2716cdc06ee681ea16f8504950deb7e76d79d81d78ecd2c7ef3c717fc62","last_reissued_at":"2026-05-18T03:13:33.968465Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:13:33.968465Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Minimum Dominating Sets in Scale-Free Network Ensembles","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cond-mat.stat-mech","cs.SI"],"primary_cat":"physics.soc-ph","authors_text":"B.K. Szymanski, F. Molnar Jr., G. Korniss, S. Sreenivasan","submitted_at":"2013-02-11T16:06:32Z","abstract_excerpt":"We study the scaling behavior of the size of minimum dominating set (MDS) in scale-free networks, with respect to network size $N$ and power-law exponent $\\gamma$, while keeping the average degree fixed. We study ensembles generated by three different network construction methods, and we use a greedy algorithm to approximate the MDS. With a structural cutoff imposed on the maximal degree ($k_{\\max}=\\sqrt{N}$) we find linear scaling of the MDS size with respect to $N$ in all three network classes. Without any cutoff ($k_{\\max}=N-1$) two of the network classes display a transition at $\\gamma \\ap"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1302.2518","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1302.2518","created_at":"2026-05-18T03:13:33.968611+00:00"},{"alias_kind":"arxiv_version","alias_value":"1302.2518v2","created_at":"2026-05-18T03:13:33.968611+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1302.2518","created_at":"2026-05-18T03:13:33.968611+00:00"},{"alias_kind":"pith_short_12","alias_value":"4MQME4LM3QDO","created_at":"2026-05-18T12:27:34.582898+00:00"},{"alias_kind":"pith_short_16","alias_value":"4MQME4LM3QDO42A6","created_at":"2026-05-18T12:27:34.582898+00:00"},{"alias_kind":"pith_short_8","alias_value":"4MQME4LM","created_at":"2026-05-18T12:27:34.582898+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/4MQME4LM3QDO42A6UFXYKBEVBX","json":"https://pith.science/pith/4MQME4LM3QDO42A6UFXYKBEVBX.json","graph_json":"https://pith.science/api/pith-number/4MQME4LM3QDO42A6UFXYKBEVBX/graph.json","events_json":"https://pith.science/api/pith-number/4MQME4LM3QDO42A6UFXYKBEVBX/events.json","paper":"https://pith.science/paper/4MQME4LM"},"agent_actions":{"view_html":"https://pith.science/pith/4MQME4LM3QDO42A6UFXYKBEVBX","download_json":"https://pith.science/pith/4MQME4LM3QDO42A6UFXYKBEVBX.json","view_paper":"https://pith.science/paper/4MQME4LM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1302.2518&json=true","fetch_graph":"https://pith.science/api/pith-number/4MQME4LM3QDO42A6UFXYKBEVBX/graph.json","fetch_events":"https://pith.science/api/pith-number/4MQME4LM3QDO42A6UFXYKBEVBX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4MQME4LM3QDO42A6UFXYKBEVBX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4MQME4LM3QDO42A6UFXYKBEVBX/action/storage_attestation","attest_author":"https://pith.science/pith/4MQME4LM3QDO42A6UFXYKBEVBX/action/author_attestation","sign_citation":"https://pith.science/pith/4MQME4LM3QDO42A6UFXYKBEVBX/action/citation_signature","submit_replication":"https://pith.science/pith/4MQME4LM3QDO42A6UFXYKBEVBX/action/replication_record"}},"created_at":"2026-05-18T03:13:33.968611+00:00","updated_at":"2026-05-18T03:13:33.968611+00:00"}