{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:2VWU2MKOFUVEFWOPPIKEVBPYJE","short_pith_number":"pith:2VWU2MKO","schema_version":"1.0","canonical_sha256":"d56d4d314e2d2a42d9cf7a144a85f8490ce8a04c1a2156e09cea7c7117985966","source":{"kind":"arxiv","id":"1805.04378","version":1},"attestation_state":"computed","paper":{"title":"Revisiting the Hamiltonian Theme in the Square of a Block: The General Case","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Gek L. Chia, Herbert Fleischner","submitted_at":"2018-05-11T13:10:43Z","abstract_excerpt":"This is the second part of joint research in which we show that every $2$-connected graph $G$ has the ${\\cal F}_4$ property. That is, given distinct $x_i\\in V(G)$, $1\\leq i\\leq 4$, there is an $x_1x_2$-hamiltonian path in $G^2$ containing different edges $x_3y_3, x_4y_4\\in E(G)$ for some $y_3,y_4\\in V(G)$. However, it was shown already in \\cite[Theorem 2]{cf1:refer} that 2-connected DT-graphs have the ${\\cal F}_4$ property; based on this result we generalize it to arbitrary $2$-connected graphs. We also show that these results are best possible."},"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":"1805.04378","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-05-11T13:10:43Z","cross_cats_sorted":[],"title_canon_sha256":"ed354ce5ce5931db789ba912e81dbadc2ddd42fe700eb7bf2c01ba3bf46d47f0","abstract_canon_sha256":"96760ee6972922780518ec38e3d4d8128344c1683b143e89be490a8f2dea4fa1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:16:12.676465Z","signature_b64":"+ClYKarLxS//RQBvtQ7pCrVZx8bp7avbPtkGPNheI8DNkI+yWPZxXVnXgoTvCXlnVeECRpQ9S8KUFEAoYeELCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d56d4d314e2d2a42d9cf7a144a85f8490ce8a04c1a2156e09cea7c7117985966","last_reissued_at":"2026-05-18T00:16:12.675858Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:16:12.675858Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Revisiting the Hamiltonian Theme in the Square of a Block: The General Case","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Gek L. Chia, Herbert Fleischner","submitted_at":"2018-05-11T13:10:43Z","abstract_excerpt":"This is the second part of joint research in which we show that every $2$-connected graph $G$ has the ${\\cal F}_4$ property. That is, given distinct $x_i\\in V(G)$, $1\\leq i\\leq 4$, there is an $x_1x_2$-hamiltonian path in $G^2$ containing different edges $x_3y_3, x_4y_4\\in E(G)$ for some $y_3,y_4\\in V(G)$. However, it was shown already in \\cite[Theorem 2]{cf1:refer} that 2-connected DT-graphs have the ${\\cal F}_4$ property; based on this result we generalize it to arbitrary $2$-connected graphs. We also show that these results are best possible."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.04378","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":"1805.04378","created_at":"2026-05-18T00:16:12.675946+00:00"},{"alias_kind":"arxiv_version","alias_value":"1805.04378v1","created_at":"2026-05-18T00:16:12.675946+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.04378","created_at":"2026-05-18T00:16:12.675946+00:00"},{"alias_kind":"pith_short_12","alias_value":"2VWU2MKOFUVE","created_at":"2026-05-18T12:32:02.567920+00:00"},{"alias_kind":"pith_short_16","alias_value":"2VWU2MKOFUVEFWOP","created_at":"2026-05-18T12:32:02.567920+00:00"},{"alias_kind":"pith_short_8","alias_value":"2VWU2MKO","created_at":"2026-05-18T12:32:02.567920+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/2VWU2MKOFUVEFWOPPIKEVBPYJE","json":"https://pith.science/pith/2VWU2MKOFUVEFWOPPIKEVBPYJE.json","graph_json":"https://pith.science/api/pith-number/2VWU2MKOFUVEFWOPPIKEVBPYJE/graph.json","events_json":"https://pith.science/api/pith-number/2VWU2MKOFUVEFWOPPIKEVBPYJE/events.json","paper":"https://pith.science/paper/2VWU2MKO"},"agent_actions":{"view_html":"https://pith.science/pith/2VWU2MKOFUVEFWOPPIKEVBPYJE","download_json":"https://pith.science/pith/2VWU2MKOFUVEFWOPPIKEVBPYJE.json","view_paper":"https://pith.science/paper/2VWU2MKO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1805.04378&json=true","fetch_graph":"https://pith.science/api/pith-number/2VWU2MKOFUVEFWOPPIKEVBPYJE/graph.json","fetch_events":"https://pith.science/api/pith-number/2VWU2MKOFUVEFWOPPIKEVBPYJE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2VWU2MKOFUVEFWOPPIKEVBPYJE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2VWU2MKOFUVEFWOPPIKEVBPYJE/action/storage_attestation","attest_author":"https://pith.science/pith/2VWU2MKOFUVEFWOPPIKEVBPYJE/action/author_attestation","sign_citation":"https://pith.science/pith/2VWU2MKOFUVEFWOPPIKEVBPYJE/action/citation_signature","submit_replication":"https://pith.science/pith/2VWU2MKOFUVEFWOPPIKEVBPYJE/action/replication_record"}},"created_at":"2026-05-18T00:16:12.675946+00:00","updated_at":"2026-05-18T00:16:12.675946+00:00"}