{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2021:HNWW4RII4RJ7VGZCDOVZJ7ALTH","short_pith_number":"pith:HNWW4RII","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"},"canonical_sha256":"3b6d6e4508e453fa9b221bab94fc0b99dc8cd74f7f5b610669e3d7a8b5015854","source":{"kind":"arxiv","id":"2112.04448","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2112.04448","created_at":"2026-07-05T03:54:25Z"},{"alias_kind":"arxiv_version","alias_value":"2112.04448v2","created_at":"2026-07-05T03:54:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2112.04448","created_at":"2026-07-05T03:54:25Z"},{"alias_kind":"pith_short_12","alias_value":"HNWW4RII4RJ7","created_at":"2026-07-05T03:54:25Z"},{"alias_kind":"pith_short_16","alias_value":"HNWW4RII4RJ7VGZC","created_at":"2026-07-05T03:54:25Z"},{"alias_kind":"pith_short_8","alias_value":"HNWW4RII","created_at":"2026-07-05T03:54:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2021:HNWW4RII4RJ7VGZCDOVZJ7ALTH","target":"record","payload":{"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"},"canonical_sha256":"3b6d6e4508e453fa9b221bab94fc0b99dc8cd74f7f5b610669e3d7a8b5015854","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"},"source_kind":"arxiv","source_id":"2112.04448","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T03:54:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"prQ4eGF3VzxzVzqczV5sZPZLkraJ5iPT1XA26Nv/c6TrU7mfcq8OjuBVZY6v5BaAyySa2ifeDRm9vNzilQIGDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-08T18:12:38.816999Z"},"content_sha256":"532defebc15b691a0cf41a354cb0f752e1e0ef8560fa975c544f2e6b98e05891","schema_version":"1.0","event_id":"sha256:532defebc15b691a0cf41a354cb0f752e1e0ef8560fa975c544f2e6b98e05891"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2021:HNWW4RII4RJ7VGZCDOVZJ7ALTH","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T03:54:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"10714dY9dNv1vPOlIrl6v1i33Rn/YhxAh5Xg2ER2hY10T6Hn9//GpO6YLffKInW/C3LK7dV0MZZJd6GYbCX2Aw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-08T18:12:38.817373Z"},"content_sha256":"e5d6137d8f12d5c83727f1cc29cf66010dc77c15db7c72318274a3299b173011","schema_version":"1.0","event_id":"sha256:e5d6137d8f12d5c83727f1cc29cf66010dc77c15db7c72318274a3299b173011"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HNWW4RII4RJ7VGZCDOVZJ7ALTH/bundle.json","state_url":"https://pith.science/pith/HNWW4RII4RJ7VGZCDOVZJ7ALTH/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HNWW4RII4RJ7VGZCDOVZJ7ALTH/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-07-08T18:12:38Z","links":{"resolver":"https://pith.science/pith/HNWW4RII4RJ7VGZCDOVZJ7ALTH","bundle":"https://pith.science/pith/HNWW4RII4RJ7VGZCDOVZJ7ALTH/bundle.json","state":"https://pith.science/pith/HNWW4RII4RJ7VGZCDOVZJ7ALTH/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HNWW4RII4RJ7VGZCDOVZJ7ALTH/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2021:HNWW4RII4RJ7VGZCDOVZJ7ALTH","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"a768b982457e201d3aaaaab436363d62ee510a7400d3fd3b45e63f7a0d460879","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2021-12-08T18:19:17Z","title_canon_sha256":"45bb12b382309230383f6b6d34492f28f2de956095feac002b3c792f2bd40256"},"schema_version":"1.0","source":{"id":"2112.04448","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2112.04448","created_at":"2026-07-05T03:54:25Z"},{"alias_kind":"arxiv_version","alias_value":"2112.04448v2","created_at":"2026-07-05T03:54:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2112.04448","created_at":"2026-07-05T03:54:25Z"},{"alias_kind":"pith_short_12","alias_value":"HNWW4RII4RJ7","created_at":"2026-07-05T03:54:25Z"},{"alias_kind":"pith_short_16","alias_value":"HNWW4RII4RJ7VGZC","created_at":"2026-07-05T03:54:25Z"},{"alias_kind":"pith_short_8","alias_value":"HNWW4RII","created_at":"2026-07-05T03:54:25Z"}],"graph_snapshots":[{"event_id":"sha256:e5d6137d8f12d5c83727f1cc29cf66010dc77c15db7c72318274a3299b173011","target":"graph","created_at":"2026-07-05T03:54:25Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2112.04448/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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$.","authors_text":"Chassidy Bozeman, Heather Smith Blake, Karen Seyffarth, Kira Adaricheva, Margaret-Ellen Messinger, Nancy E. Clarke, Ruth Haas","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2021-12-08T18:19:17Z","title":"Hamilton Paths in Dominating Graphs of Trees and Cycles"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2112.04448","kind":"arxiv","version":2},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:532defebc15b691a0cf41a354cb0f752e1e0ef8560fa975c544f2e6b98e05891","target":"record","created_at":"2026-07-05T03:54:25Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"a768b982457e201d3aaaaab436363d62ee510a7400d3fd3b45e63f7a0d460879","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2021-12-08T18:19:17Z","title_canon_sha256":"45bb12b382309230383f6b6d34492f28f2de956095feac002b3c792f2bd40256"},"schema_version":"1.0","source":{"id":"2112.04448","kind":"arxiv","version":2}},"canonical_sha256":"3b6d6e4508e453fa9b221bab94fc0b99dc8cd74f7f5b610669e3d7a8b5015854","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3b6d6e4508e453fa9b221bab94fc0b99dc8cd74f7f5b610669e3d7a8b5015854","first_computed_at":"2026-07-05T03:54:25.792639Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T03:54:25.792639Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"zIhjrzKus908wuESHg6J+6EZSMebXN0CXtOoN3k+AC9Ruz7+17oFEHAED3ON8EBr14sqkFZb3HDLjAjaqNbTAg==","signature_status":"signed_v1","signed_at":"2026-07-05T03:54:25.793041Z","signed_message":"canonical_sha256_bytes"},"source_id":"2112.04448","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:532defebc15b691a0cf41a354cb0f752e1e0ef8560fa975c544f2e6b98e05891","sha256:e5d6137d8f12d5c83727f1cc29cf66010dc77c15db7c72318274a3299b173011"],"state_sha256":"c41815ccc569ae9a6b6f4f26def5992f7e552cb918465d04d272b60e94fb18d6"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9djlXExVsy9kaxQhgHLuqUAaXwCsrqBolXWhDzrW55Wiv7D+gQUGTAhAp23vypvnMXLsl10SIuevSo1DwVI6AQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-08T18:12:38.819546Z","bundle_sha256":"362e1862061b0721ab41842cb3e6b2cc7660cc6db931f08bf49fb13fcadc4c54"}}