{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:ENV6KIEWDWGOPM27D74WYQQ5LR","short_pith_number":"pith:ENV6KIEW","schema_version":"1.0","canonical_sha256":"236be520961d8ce7b35f1ff96c421d5c672a562c3d72475d3375869409250b16","source":{"kind":"arxiv","id":"1812.02894","version":1},"attestation_state":"computed","paper":{"title":"The Chv\\'atal-Erd\\H{o}s condition for prism-Hamiltonicity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"M. N. Ellingham, Pouria Salehi Nowbandegani","submitted_at":"2018-12-07T03:49:31Z","abstract_excerpt":"The prism over a graph $G$ is the cartesian product $G \\Box K_2$. It is known that the property of having a Hamiltonian prism (prism-Hamiltonicity) is stronger than that of having a $2$-walk (spanning closed walk using every vertex at most twice) and weaker than that of having a Hamilton path. For a graph $G$, it is known that $\\alpha(G) \\leq 2 \\kappa(G)$, where $\\alpha(G)$ is the independence number and $\\kappa(G)$ is the connectivity, imples existence of a $2$-walk in $G$, and the bound is sharp. West asked for a bound on $\\alpha (G)$ in terms of $\\kappa (G)$ guaranteeing prism-Hamiltonicity"},"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":"1812.02894","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-12-07T03:49:31Z","cross_cats_sorted":[],"title_canon_sha256":"fffc1c7928db527191348de23da6162ef34febf758ca8a817ba88cf1bdcef2c9","abstract_canon_sha256":"38ad245c1832778daaab2ac949c224111967ac581c310db1343fc2e1d31d24d1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:58:51.509462Z","signature_b64":"Rv7rWxSIk/unwoaA/abSFnnfxV8FJ7mOdeFEYmMFs3BFNg5otiWmVtoHgShnWCfp46+hTx9Ojgbc/KHbWssHBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"236be520961d8ce7b35f1ff96c421d5c672a562c3d72475d3375869409250b16","last_reissued_at":"2026-05-17T23:58:51.508957Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:58:51.508957Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Chv\\'atal-Erd\\H{o}s condition for prism-Hamiltonicity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"M. N. Ellingham, Pouria Salehi Nowbandegani","submitted_at":"2018-12-07T03:49:31Z","abstract_excerpt":"The prism over a graph $G$ is the cartesian product $G \\Box K_2$. It is known that the property of having a Hamiltonian prism (prism-Hamiltonicity) is stronger than that of having a $2$-walk (spanning closed walk using every vertex at most twice) and weaker than that of having a Hamilton path. For a graph $G$, it is known that $\\alpha(G) \\leq 2 \\kappa(G)$, where $\\alpha(G)$ is the independence number and $\\kappa(G)$ is the connectivity, imples existence of a $2$-walk in $G$, and the bound is sharp. West asked for a bound on $\\alpha (G)$ in terms of $\\kappa (G)$ guaranteeing prism-Hamiltonicity"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1812.02894","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":"1812.02894","created_at":"2026-05-17T23:58:51.509039+00:00"},{"alias_kind":"arxiv_version","alias_value":"1812.02894v1","created_at":"2026-05-17T23:58:51.509039+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1812.02894","created_at":"2026-05-17T23:58:51.509039+00:00"},{"alias_kind":"pith_short_12","alias_value":"ENV6KIEWDWGO","created_at":"2026-05-18T12:32:22.470017+00:00"},{"alias_kind":"pith_short_16","alias_value":"ENV6KIEWDWGOPM27","created_at":"2026-05-18T12:32:22.470017+00:00"},{"alias_kind":"pith_short_8","alias_value":"ENV6KIEW","created_at":"2026-05-18T12:32:22.470017+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/ENV6KIEWDWGOPM27D74WYQQ5LR","json":"https://pith.science/pith/ENV6KIEWDWGOPM27D74WYQQ5LR.json","graph_json":"https://pith.science/api/pith-number/ENV6KIEWDWGOPM27D74WYQQ5LR/graph.json","events_json":"https://pith.science/api/pith-number/ENV6KIEWDWGOPM27D74WYQQ5LR/events.json","paper":"https://pith.science/paper/ENV6KIEW"},"agent_actions":{"view_html":"https://pith.science/pith/ENV6KIEWDWGOPM27D74WYQQ5LR","download_json":"https://pith.science/pith/ENV6KIEWDWGOPM27D74WYQQ5LR.json","view_paper":"https://pith.science/paper/ENV6KIEW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1812.02894&json=true","fetch_graph":"https://pith.science/api/pith-number/ENV6KIEWDWGOPM27D74WYQQ5LR/graph.json","fetch_events":"https://pith.science/api/pith-number/ENV6KIEWDWGOPM27D74WYQQ5LR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ENV6KIEWDWGOPM27D74WYQQ5LR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ENV6KIEWDWGOPM27D74WYQQ5LR/action/storage_attestation","attest_author":"https://pith.science/pith/ENV6KIEWDWGOPM27D74WYQQ5LR/action/author_attestation","sign_citation":"https://pith.science/pith/ENV6KIEWDWGOPM27D74WYQQ5LR/action/citation_signature","submit_replication":"https://pith.science/pith/ENV6KIEWDWGOPM27D74WYQQ5LR/action/replication_record"}},"created_at":"2026-05-17T23:58:51.509039+00:00","updated_at":"2026-05-17T23:58:51.509039+00:00"}