{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:VM4RHRITLIZEVLIVWJB7SING7G","short_pith_number":"pith:VM4RHRIT","canonical_record":{"source":{"id":"1706.04414","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-06-14T11:26:11Z","cross_cats_sorted":[],"title_canon_sha256":"aa2ab410dc25af059a7944d54bbd2f179ca57481f311c5cc558f5b8c8371eb32","abstract_canon_sha256":"fedc13eb84ceedd6180f8a73ea1c3d07a09937a4aa971f9ccc74af2cc6889185"},"schema_version":"1.0"},"canonical_sha256":"ab3913c5135a324aad15b243f921a6f9882d7afae9f76ea0b1208beccbc77495","source":{"kind":"arxiv","id":"1706.04414","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1706.04414","created_at":"2026-05-18T00:42:22Z"},{"alias_kind":"arxiv_version","alias_value":"1706.04414v1","created_at":"2026-05-18T00:42:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.04414","created_at":"2026-05-18T00:42:22Z"},{"alias_kind":"pith_short_12","alias_value":"VM4RHRITLIZE","created_at":"2026-05-18T12:31:49Z"},{"alias_kind":"pith_short_16","alias_value":"VM4RHRITLIZEVLIV","created_at":"2026-05-18T12:31:49Z"},{"alias_kind":"pith_short_8","alias_value":"VM4RHRIT","created_at":"2026-05-18T12:31:49Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:VM4RHRITLIZEVLIVWJB7SING7G","target":"record","payload":{"canonical_record":{"source":{"id":"1706.04414","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-06-14T11:26:11Z","cross_cats_sorted":[],"title_canon_sha256":"aa2ab410dc25af059a7944d54bbd2f179ca57481f311c5cc558f5b8c8371eb32","abstract_canon_sha256":"fedc13eb84ceedd6180f8a73ea1c3d07a09937a4aa971f9ccc74af2cc6889185"},"schema_version":"1.0"},"canonical_sha256":"ab3913c5135a324aad15b243f921a6f9882d7afae9f76ea0b1208beccbc77495","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:42:22.731513Z","signature_b64":"NdwyeOGsXCyzDdDWdF14XDYX++tProG7tFvKaMjlt9DIKGyH5G4a2lonTs9Fr5jLtuCt0R0hWPqpI6al0oZrDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ab3913c5135a324aad15b243f921a6f9882d7afae9f76ea0b1208beccbc77495","last_reissued_at":"2026-05-18T00:42:22.730872Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:42:22.730872Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1706.04414","source_version":1,"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-05-18T00:42:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mM+kH4UEHLGAYJGlz0iUESCQ8dYNwwU9neZCxf+qV/D7btk8cIdfx/+GvpBc9GWK8mnFzm28MiQzm4ppg55BAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T10:04:20.328755Z"},"content_sha256":"2234cb07a01974b089c6bd6d98daca546355b4d08d6e0b3ed7559b721ea96c1b","schema_version":"1.0","event_id":"sha256:2234cb07a01974b089c6bd6d98daca546355b4d08d6e0b3ed7559b721ea96c1b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:VM4RHRITLIZEVLIVWJB7SING7G","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Revisiting the Hamiltonian Theme in the Square of a Block: The Case of DT-Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Gek L. Chia, Herbert Fleischner, Jan Ekstein","submitted_at":"2017-06-14T11:26:11Z","abstract_excerpt":"The square of a graph G, denoted G^2, is the graph obtained from G by joining by an edge any two nonadjacent vertices which have a common neighbor. A graph G is said to have the F_k property if for any set of k distinct vertices {x_1, x_2, ..., x_k} in G, there is a hamiltonian path from x_1 to x_2 in G^2 containing k-2 distinct edges of G of the form x_iz_i, i = 3, ..., k. It was proved many years ago that every 2-connected graph has the F_3 property. In the first part of this work, we extend this result by proving that every 2-connected DT-graph has the F_4 property (Theorem 2) and will show"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.04414","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"},"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-05-18T00:42:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zgVSvgan21VhHP4vxDnrLcRR11aZEXd0jERa900LVtWNyuUpFue8a9dfbJ2DyGOhieaD5ulDWAGdlRty0+FdBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T10:04:20.329369Z"},"content_sha256":"b79cdde4a2dc4cb221783c9f7d9a3bdee72a5f3358fdfc20242229394d3f81a9","schema_version":"1.0","event_id":"sha256:b79cdde4a2dc4cb221783c9f7d9a3bdee72a5f3358fdfc20242229394d3f81a9"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VM4RHRITLIZEVLIVWJB7SING7G/bundle.json","state_url":"https://pith.science/pith/VM4RHRITLIZEVLIVWJB7SING7G/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VM4RHRITLIZEVLIVWJB7SING7G/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-05-25T10:04:20Z","links":{"resolver":"https://pith.science/pith/VM4RHRITLIZEVLIVWJB7SING7G","bundle":"https://pith.science/pith/VM4RHRITLIZEVLIVWJB7SING7G/bundle.json","state":"https://pith.science/pith/VM4RHRITLIZEVLIVWJB7SING7G/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VM4RHRITLIZEVLIVWJB7SING7G/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:VM4RHRITLIZEVLIVWJB7SING7G","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":"fedc13eb84ceedd6180f8a73ea1c3d07a09937a4aa971f9ccc74af2cc6889185","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-06-14T11:26:11Z","title_canon_sha256":"aa2ab410dc25af059a7944d54bbd2f179ca57481f311c5cc558f5b8c8371eb32"},"schema_version":"1.0","source":{"id":"1706.04414","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1706.04414","created_at":"2026-05-18T00:42:22Z"},{"alias_kind":"arxiv_version","alias_value":"1706.04414v1","created_at":"2026-05-18T00:42:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.04414","created_at":"2026-05-18T00:42:22Z"},{"alias_kind":"pith_short_12","alias_value":"VM4RHRITLIZE","created_at":"2026-05-18T12:31:49Z"},{"alias_kind":"pith_short_16","alias_value":"VM4RHRITLIZEVLIV","created_at":"2026-05-18T12:31:49Z"},{"alias_kind":"pith_short_8","alias_value":"VM4RHRIT","created_at":"2026-05-18T12:31:49Z"}],"graph_snapshots":[{"event_id":"sha256:b79cdde4a2dc4cb221783c9f7d9a3bdee72a5f3358fdfc20242229394d3f81a9","target":"graph","created_at":"2026-05-18T00:42:22Z","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"},"paper":{"abstract_excerpt":"The square of a graph G, denoted G^2, is the graph obtained from G by joining by an edge any two nonadjacent vertices which have a common neighbor. A graph G is said to have the F_k property if for any set of k distinct vertices {x_1, x_2, ..., x_k} in G, there is a hamiltonian path from x_1 to x_2 in G^2 containing k-2 distinct edges of G of the form x_iz_i, i = 3, ..., k. It was proved many years ago that every 2-connected graph has the F_3 property. In the first part of this work, we extend this result by proving that every 2-connected DT-graph has the F_4 property (Theorem 2) and will show","authors_text":"Gek L. Chia, Herbert Fleischner, Jan Ekstein","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-06-14T11:26:11Z","title":"Revisiting the Hamiltonian Theme in the Square of a Block: The Case of DT-Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.04414","kind":"arxiv","version":1},"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:2234cb07a01974b089c6bd6d98daca546355b4d08d6e0b3ed7559b721ea96c1b","target":"record","created_at":"2026-05-18T00:42:22Z","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":"fedc13eb84ceedd6180f8a73ea1c3d07a09937a4aa971f9ccc74af2cc6889185","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-06-14T11:26:11Z","title_canon_sha256":"aa2ab410dc25af059a7944d54bbd2f179ca57481f311c5cc558f5b8c8371eb32"},"schema_version":"1.0","source":{"id":"1706.04414","kind":"arxiv","version":1}},"canonical_sha256":"ab3913c5135a324aad15b243f921a6f9882d7afae9f76ea0b1208beccbc77495","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ab3913c5135a324aad15b243f921a6f9882d7afae9f76ea0b1208beccbc77495","first_computed_at":"2026-05-18T00:42:22.730872Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:42:22.730872Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"NdwyeOGsXCyzDdDWdF14XDYX++tProG7tFvKaMjlt9DIKGyH5G4a2lonTs9Fr5jLtuCt0R0hWPqpI6al0oZrDw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:42:22.731513Z","signed_message":"canonical_sha256_bytes"},"source_id":"1706.04414","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2234cb07a01974b089c6bd6d98daca546355b4d08d6e0b3ed7559b721ea96c1b","sha256:b79cdde4a2dc4cb221783c9f7d9a3bdee72a5f3358fdfc20242229394d3f81a9"],"state_sha256":"15bdb112acac21d17925c7e6c5f11ecb68e1fd06d117705df183038e083809bc"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ASPOMIMpXWOK4lYYwvlHj5j4MLz4D5w9G47hn7Jshhw46o1UCmt6fr/nfJhMYq4BWGg5lSqddlK+FwdFNV+dAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T10:04:20.332873Z","bundle_sha256":"35a0df518ea95554ec7b6e20de2445cd3117b04fae50180a3b144bc8651f83b7"}}