{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:FAT6LCGX6AA3R7FEKYBTJCZP2P","short_pith_number":"pith:FAT6LCGX","schema_version":"1.0","canonical_sha256":"2827e588d7f001b8fca45603348b2fd3e512476f3be8ea4e7170575e7bf27792","source":{"kind":"arxiv","id":"1705.03096","version":1},"attestation_state":"computed","paper":{"title":"Partial Domination in Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Benjamin M. Case, Drew J. Lipman, Renu C. Laskar, Stephen T. Hedetniemi","submitted_at":"2017-05-08T21:32:44Z","abstract_excerpt":"A set $S\\subseteq V$ is a dominating set of $G$ if every vertex in $V - S$ is adjacent to at least one vertex in $S$. The domination number $\\gamma(G)$ of $G$ equals the minimum cardinality of a dominating set $S$ in $G$; we say that such a set $S$ is a $\\gamma$-set. The single greatest focus of research in domination theory is the determination of the value of $\\gamma(G)$. By definition, all vertices must be dominated by a $\\gamma$-set. In this paper we propose relaxing this requirement, by seeking sets of vertices that dominate a prescribed fraction of the vertices of a graph. We focus parti"},"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":"1705.03096","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-05-08T21:32:44Z","cross_cats_sorted":[],"title_canon_sha256":"e0ae23d31341bf8f4499f50d818fd7612b04cd8a69a6a95c7190b17c785a52ea","abstract_canon_sha256":"5b840accf84f3e0ed4b33e930662f5e669bc4e871f40b5896bb27c3349aed967"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:44:50.724171Z","signature_b64":"H3nNbUwd2rCCEk1N6nxRRggh6ye9aLm6XptUgZPv9v/bKuI9+pLPWfdcXZXo5ZM9cb6LCoBCYahumYJCfUz9Dw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2827e588d7f001b8fca45603348b2fd3e512476f3be8ea4e7170575e7bf27792","last_reissued_at":"2026-05-18T00:44:50.723531Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:44:50.723531Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Partial Domination in Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Benjamin M. Case, Drew J. Lipman, Renu C. Laskar, Stephen T. Hedetniemi","submitted_at":"2017-05-08T21:32:44Z","abstract_excerpt":"A set $S\\subseteq V$ is a dominating set of $G$ if every vertex in $V - S$ is adjacent to at least one vertex in $S$. The domination number $\\gamma(G)$ of $G$ equals the minimum cardinality of a dominating set $S$ in $G$; we say that such a set $S$ is a $\\gamma$-set. The single greatest focus of research in domination theory is the determination of the value of $\\gamma(G)$. By definition, all vertices must be dominated by a $\\gamma$-set. In this paper we propose relaxing this requirement, by seeking sets of vertices that dominate a prescribed fraction of the vertices of a graph. We focus parti"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.03096","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":"1705.03096","created_at":"2026-05-18T00:44:50.723641+00:00"},{"alias_kind":"arxiv_version","alias_value":"1705.03096v1","created_at":"2026-05-18T00:44:50.723641+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.03096","created_at":"2026-05-18T00:44:50.723641+00:00"},{"alias_kind":"pith_short_12","alias_value":"FAT6LCGX6AA3","created_at":"2026-05-18T12:31:15.632608+00:00"},{"alias_kind":"pith_short_16","alias_value":"FAT6LCGX6AA3R7FE","created_at":"2026-05-18T12:31:15.632608+00:00"},{"alias_kind":"pith_short_8","alias_value":"FAT6LCGX","created_at":"2026-05-18T12:31:15.632608+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/FAT6LCGX6AA3R7FEKYBTJCZP2P","json":"https://pith.science/pith/FAT6LCGX6AA3R7FEKYBTJCZP2P.json","graph_json":"https://pith.science/api/pith-number/FAT6LCGX6AA3R7FEKYBTJCZP2P/graph.json","events_json":"https://pith.science/api/pith-number/FAT6LCGX6AA3R7FEKYBTJCZP2P/events.json","paper":"https://pith.science/paper/FAT6LCGX"},"agent_actions":{"view_html":"https://pith.science/pith/FAT6LCGX6AA3R7FEKYBTJCZP2P","download_json":"https://pith.science/pith/FAT6LCGX6AA3R7FEKYBTJCZP2P.json","view_paper":"https://pith.science/paper/FAT6LCGX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1705.03096&json=true","fetch_graph":"https://pith.science/api/pith-number/FAT6LCGX6AA3R7FEKYBTJCZP2P/graph.json","fetch_events":"https://pith.science/api/pith-number/FAT6LCGX6AA3R7FEKYBTJCZP2P/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FAT6LCGX6AA3R7FEKYBTJCZP2P/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FAT6LCGX6AA3R7FEKYBTJCZP2P/action/storage_attestation","attest_author":"https://pith.science/pith/FAT6LCGX6AA3R7FEKYBTJCZP2P/action/author_attestation","sign_citation":"https://pith.science/pith/FAT6LCGX6AA3R7FEKYBTJCZP2P/action/citation_signature","submit_replication":"https://pith.science/pith/FAT6LCGX6AA3R7FEKYBTJCZP2P/action/replication_record"}},"created_at":"2026-05-18T00:44:50.723641+00:00","updated_at":"2026-05-18T00:44:50.723641+00:00"}