{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:QWPACI3MHCOJHR4HJXJXCCQLFX","short_pith_number":"pith:QWPACI3M","schema_version":"1.0","canonical_sha256":"859e01236c389c93c7874dd3710a0b2dee97d95f303f3ba55b31b7a4021ea63c","source":{"kind":"arxiv","id":"1303.0944","version":2},"attestation_state":"computed","paper":{"title":"Total Domishold Graphs: a Generalization of Threshold Graphs, with Connections to Threshold Hypergraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Martin Milanic, Nina Chiarelli","submitted_at":"2013-03-05T06:50:18Z","abstract_excerpt":"A total dominating set in a graph is a set of vertices such that every vertex of the graph has a neighbor in the set. We introduce and study graphs that admit non-negative real weights associated to their vertices such that a set of vertices is a total dominating set if and only if the sum of the corresponding weights exceeds a certain threshold. We show that these graphs, which we call total domishold graphs, form a non-hereditary class of graphs properly containing the classes of threshold graphs and the complements of domishold graphs, and are closely related to threshold Boolean functions "},"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":"1303.0944","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-03-05T06:50:18Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"a13a0dd5a508d054d734a090ac7d76387fc48392cc4f396138f9b30f272a5db3","abstract_canon_sha256":"396b583c5d950945cecd83f672a2f14b79e5fe0a36f9b3359c96c5caa29eb4df"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:16:21.525022Z","signature_b64":"gKNL26FdtfuESUOb0eqo1AqxCAwsqMwX5T91Cah/r9ncsuMh7Puni2ew0N3aL5/o46ydDA0iNWebsotfgIR2Cw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"859e01236c389c93c7874dd3710a0b2dee97d95f303f3ba55b31b7a4021ea63c","last_reissued_at":"2026-05-18T02:16:21.524348Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:16:21.524348Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Total Domishold Graphs: a Generalization of Threshold Graphs, with Connections to Threshold Hypergraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Martin Milanic, Nina Chiarelli","submitted_at":"2013-03-05T06:50:18Z","abstract_excerpt":"A total dominating set in a graph is a set of vertices such that every vertex of the graph has a neighbor in the set. We introduce and study graphs that admit non-negative real weights associated to their vertices such that a set of vertices is a total dominating set if and only if the sum of the corresponding weights exceeds a certain threshold. We show that these graphs, which we call total domishold graphs, form a non-hereditary class of graphs properly containing the classes of threshold graphs and the complements of domishold graphs, and are closely related to threshold Boolean functions "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1303.0944","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":"1303.0944","created_at":"2026-05-18T02:16:21.524466+00:00"},{"alias_kind":"arxiv_version","alias_value":"1303.0944v2","created_at":"2026-05-18T02:16:21.524466+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1303.0944","created_at":"2026-05-18T02:16:21.524466+00:00"},{"alias_kind":"pith_short_12","alias_value":"QWPACI3MHCOJ","created_at":"2026-05-18T12:27:57.521954+00:00"},{"alias_kind":"pith_short_16","alias_value":"QWPACI3MHCOJHR4H","created_at":"2026-05-18T12:27:57.521954+00:00"},{"alias_kind":"pith_short_8","alias_value":"QWPACI3M","created_at":"2026-05-18T12:27:57.521954+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/QWPACI3MHCOJHR4HJXJXCCQLFX","json":"https://pith.science/pith/QWPACI3MHCOJHR4HJXJXCCQLFX.json","graph_json":"https://pith.science/api/pith-number/QWPACI3MHCOJHR4HJXJXCCQLFX/graph.json","events_json":"https://pith.science/api/pith-number/QWPACI3MHCOJHR4HJXJXCCQLFX/events.json","paper":"https://pith.science/paper/QWPACI3M"},"agent_actions":{"view_html":"https://pith.science/pith/QWPACI3MHCOJHR4HJXJXCCQLFX","download_json":"https://pith.science/pith/QWPACI3MHCOJHR4HJXJXCCQLFX.json","view_paper":"https://pith.science/paper/QWPACI3M","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1303.0944&json=true","fetch_graph":"https://pith.science/api/pith-number/QWPACI3MHCOJHR4HJXJXCCQLFX/graph.json","fetch_events":"https://pith.science/api/pith-number/QWPACI3MHCOJHR4HJXJXCCQLFX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QWPACI3MHCOJHR4HJXJXCCQLFX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QWPACI3MHCOJHR4HJXJXCCQLFX/action/storage_attestation","attest_author":"https://pith.science/pith/QWPACI3MHCOJHR4HJXJXCCQLFX/action/author_attestation","sign_citation":"https://pith.science/pith/QWPACI3MHCOJHR4HJXJXCCQLFX/action/citation_signature","submit_replication":"https://pith.science/pith/QWPACI3MHCOJHR4HJXJXCCQLFX/action/replication_record"}},"created_at":"2026-05-18T02:16:21.524466+00:00","updated_at":"2026-05-18T02:16:21.524466+00:00"}