{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:HNWW4RII4RJ7VGZCDOVZJ7ALTH","short_pith_number":"pith:HNWW4RII","schema_version":"1.0","canonical_sha256":"3b6d6e4508e453fa9b221bab94fc0b99dc8cd74f7f5b610669e3d7a8b5015854","source":{"kind":"arxiv","id":"2112.04448","version":2},"attestation_state":"computed","paper":{"title":"Hamilton Paths in Dominating Graphs of Trees and Cycles","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Chassidy Bozeman, Heather Smith Blake, Karen Seyffarth, Kira Adaricheva, Margaret-Ellen Messinger, Nancy E. Clarke, Ruth Haas","submitted_at":"2021-12-08T18:19:17Z","abstract_excerpt":"The dominating graph of a graph $H$ has as its vertices all dominating sets of $H$, with an edge between two dominating sets if one can be obtained from the other by the addition or deletion of a single vertex of $H$. In this paper we prove that the dominating graph of any tree has a Hamilton path. We also show how a result about binary strings leads to a proof that the dominating graph of a cycle on $n$ vertices has a Hamilton path if and only if $n\\not\\equiv 0 \\pmod 4$."},"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":"2112.04448","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2021-12-08T18:19:17Z","cross_cats_sorted":[],"title_canon_sha256":"45bb12b382309230383f6b6d34492f28f2de956095feac002b3c792f2bd40256","abstract_canon_sha256":"a768b982457e201d3aaaaab436363d62ee510a7400d3fd3b45e63f7a0d460879"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:54:25.793041Z","signature_b64":"zIhjrzKus908wuESHg6J+6EZSMebXN0CXtOoN3k+AC9Ruz7+17oFEHAED3ON8EBr14sqkFZb3HDLjAjaqNbTAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3b6d6e4508e453fa9b221bab94fc0b99dc8cd74f7f5b610669e3d7a8b5015854","last_reissued_at":"2026-07-05T03:54:25.792639Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:54:25.792639Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Hamilton Paths in Dominating Graphs of Trees and Cycles","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Chassidy Bozeman, Heather Smith Blake, Karen Seyffarth, Kira Adaricheva, Margaret-Ellen Messinger, Nancy E. Clarke, Ruth Haas","submitted_at":"2021-12-08T18:19:17Z","abstract_excerpt":"The dominating graph of a graph $H$ has as its vertices all dominating sets of $H$, with an edge between two dominating sets if one can be obtained from the other by the addition or deletion of a single vertex of $H$. In this paper we prove that the dominating graph of any tree has a Hamilton path. We also show how a result about binary strings leads to a proof that the dominating graph of a cycle on $n$ vertices has a Hamilton path if and only if $n\\not\\equiv 0 \\pmod 4$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2112.04448","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2112.04448/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2112.04448","created_at":"2026-07-05T03:54:25.792694+00:00"},{"alias_kind":"arxiv_version","alias_value":"2112.04448v2","created_at":"2026-07-05T03:54:25.792694+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2112.04448","created_at":"2026-07-05T03:54:25.792694+00:00"},{"alias_kind":"pith_short_12","alias_value":"HNWW4RII4RJ7","created_at":"2026-07-05T03:54:25.792694+00:00"},{"alias_kind":"pith_short_16","alias_value":"HNWW4RII4RJ7VGZC","created_at":"2026-07-05T03:54:25.792694+00:00"},{"alias_kind":"pith_short_8","alias_value":"HNWW4RII","created_at":"2026-07-05T03:54:25.792694+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/HNWW4RII4RJ7VGZCDOVZJ7ALTH","json":"https://pith.science/pith/HNWW4RII4RJ7VGZCDOVZJ7ALTH.json","graph_json":"https://pith.science/api/pith-number/HNWW4RII4RJ7VGZCDOVZJ7ALTH/graph.json","events_json":"https://pith.science/api/pith-number/HNWW4RII4RJ7VGZCDOVZJ7ALTH/events.json","paper":"https://pith.science/paper/HNWW4RII"},"agent_actions":{"view_html":"https://pith.science/pith/HNWW4RII4RJ7VGZCDOVZJ7ALTH","download_json":"https://pith.science/pith/HNWW4RII4RJ7VGZCDOVZJ7ALTH.json","view_paper":"https://pith.science/paper/HNWW4RII","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2112.04448&json=true","fetch_graph":"https://pith.science/api/pith-number/HNWW4RII4RJ7VGZCDOVZJ7ALTH/graph.json","fetch_events":"https://pith.science/api/pith-number/HNWW4RII4RJ7VGZCDOVZJ7ALTH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HNWW4RII4RJ7VGZCDOVZJ7ALTH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HNWW4RII4RJ7VGZCDOVZJ7ALTH/action/storage_attestation","attest_author":"https://pith.science/pith/HNWW4RII4RJ7VGZCDOVZJ7ALTH/action/author_attestation","sign_citation":"https://pith.science/pith/HNWW4RII4RJ7VGZCDOVZJ7ALTH/action/citation_signature","submit_replication":"https://pith.science/pith/HNWW4RII4RJ7VGZCDOVZJ7ALTH/action/replication_record"}},"created_at":"2026-07-05T03:54:25.792694+00:00","updated_at":"2026-07-05T03:54:25.792694+00:00"}