{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:UCAR2OJSPBQVWOB6F64XBX2ZOT","short_pith_number":"pith:UCAR2OJS","schema_version":"1.0","canonical_sha256":"a0811d393278615b383e2fb970df5974e68d92c5192670dce3eb5086fef8cd72","source":{"kind":"arxiv","id":"1806.02178","version":1},"attestation_state":"computed","paper":{"title":"Blockers for simple Hamiltonian paths in convex geometric graphs of odd order","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Chaya Keller, Micha A. Perles","submitted_at":"2018-06-06T13:37:45Z","abstract_excerpt":"Let G be a complete convex geometric graph, and let F be a family of subgraphs of G. A blocker for F is a set of edges, of smallest possible size, that has an edge in common with every element of F. In [C. Keller and M. A. Perles, Blockers for simple Hamiltonian paths in convex geometric graphs of even order, Disc. Comput. Geom., 60(1) (2018), pp. 1-8] we gave an explicit description of all blockers for the family of simple (i.e., non-crossing) Hamiltonian paths (SHPs) in G in the `even' case |V(G)|=2m. It turned out that all the blockers are simple caterpillar trees of a certain class. In thi"},"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":"1806.02178","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-06-06T13:37:45Z","cross_cats_sorted":[],"title_canon_sha256":"3ac6e86d73e7f235dafa3db6df582d3cd2fce42377cd888a6658ad06214e732e","abstract_canon_sha256":"273d246c7f93cc9c43acb8104e6427c713d19a12c2b1e70f97172812c5d26278"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:14:02.452840Z","signature_b64":"Tlu6wyPDQn5kVTKePXBDxot26kiGFi+j83tshHrS7U5W3gomb4r1rvhsmyrSM4CWQokHAvVDrPvpkJsbOVguBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a0811d393278615b383e2fb970df5974e68d92c5192670dce3eb5086fef8cd72","last_reissued_at":"2026-05-18T00:14:02.452240Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:14:02.452240Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Blockers for simple Hamiltonian paths in convex geometric graphs of odd order","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Chaya Keller, Micha A. Perles","submitted_at":"2018-06-06T13:37:45Z","abstract_excerpt":"Let G be a complete convex geometric graph, and let F be a family of subgraphs of G. A blocker for F is a set of edges, of smallest possible size, that has an edge in common with every element of F. In [C. Keller and M. A. Perles, Blockers for simple Hamiltonian paths in convex geometric graphs of even order, Disc. Comput. Geom., 60(1) (2018), pp. 1-8] we gave an explicit description of all blockers for the family of simple (i.e., non-crossing) Hamiltonian paths (SHPs) in G in the `even' case |V(G)|=2m. It turned out that all the blockers are simple caterpillar trees of a certain class. In thi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.02178","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":"1806.02178","created_at":"2026-05-18T00:14:02.452359+00:00"},{"alias_kind":"arxiv_version","alias_value":"1806.02178v1","created_at":"2026-05-18T00:14:02.452359+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.02178","created_at":"2026-05-18T00:14:02.452359+00:00"},{"alias_kind":"pith_short_12","alias_value":"UCAR2OJSPBQV","created_at":"2026-05-18T12:32:56.356000+00:00"},{"alias_kind":"pith_short_16","alias_value":"UCAR2OJSPBQVWOB6","created_at":"2026-05-18T12:32:56.356000+00:00"},{"alias_kind":"pith_short_8","alias_value":"UCAR2OJS","created_at":"2026-05-18T12:32:56.356000+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/UCAR2OJSPBQVWOB6F64XBX2ZOT","json":"https://pith.science/pith/UCAR2OJSPBQVWOB6F64XBX2ZOT.json","graph_json":"https://pith.science/api/pith-number/UCAR2OJSPBQVWOB6F64XBX2ZOT/graph.json","events_json":"https://pith.science/api/pith-number/UCAR2OJSPBQVWOB6F64XBX2ZOT/events.json","paper":"https://pith.science/paper/UCAR2OJS"},"agent_actions":{"view_html":"https://pith.science/pith/UCAR2OJSPBQVWOB6F64XBX2ZOT","download_json":"https://pith.science/pith/UCAR2OJSPBQVWOB6F64XBX2ZOT.json","view_paper":"https://pith.science/paper/UCAR2OJS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1806.02178&json=true","fetch_graph":"https://pith.science/api/pith-number/UCAR2OJSPBQVWOB6F64XBX2ZOT/graph.json","fetch_events":"https://pith.science/api/pith-number/UCAR2OJSPBQVWOB6F64XBX2ZOT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UCAR2OJSPBQVWOB6F64XBX2ZOT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UCAR2OJSPBQVWOB6F64XBX2ZOT/action/storage_attestation","attest_author":"https://pith.science/pith/UCAR2OJSPBQVWOB6F64XBX2ZOT/action/author_attestation","sign_citation":"https://pith.science/pith/UCAR2OJSPBQVWOB6F64XBX2ZOT/action/citation_signature","submit_replication":"https://pith.science/pith/UCAR2OJSPBQVWOB6F64XBX2ZOT/action/replication_record"}},"created_at":"2026-05-18T00:14:02.452359+00:00","updated_at":"2026-05-18T00:14:02.452359+00:00"}