{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:Z222WZYYJVIZQDMX6GLCFTZM7J","short_pith_number":"pith:Z222WZYY","schema_version":"1.0","canonical_sha256":"ceb5ab67184d51980d97f19622cf2cfa4f6e26baec73dc08cd3bd35ec4b80e6f","source":{"kind":"arxiv","id":"2404.06105","version":1},"attestation_state":"computed","paper":{"title":"Bicolored point sets admitting non-crossing alternating Hamiltonian paths","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Jan Soukup","submitted_at":"2024-04-09T08:17:00Z","abstract_excerpt":"Consider a bicolored point set $P$ in general position in the plane consisting of $n$ blue and $n$ red points. We show that if a subset of the red points forms the vertices of a convex polygon separating the blue points, lying inside the polygon, from the remaining red points, lying outside the polygon, then the points of $P$ can be connected by non-crossing straight-line segments so that the resulting graph is a properly colored closed Hamiltonian path."},"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":"2404.06105","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2024-04-09T08:17:00Z","cross_cats_sorted":[],"title_canon_sha256":"c5e760b9fb8136bf7b9e829e59782d185863c8e60e314ef75318d99c0d51361f","abstract_canon_sha256":"fd20de30c9f1071f891b33683dea450133c86daa12519abdf5bbdbac6171b5c6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:06:04.224969Z","signature_b64":"N2eH9hZMf8sPuBr+Te3e3AbNRELOeZzXqPT5HGArbQ3r/KggK28cns5IAXsAnAajH/6cngTPY8wnQ3kjE7VUAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ceb5ab67184d51980d97f19622cf2cfa4f6e26baec73dc08cd3bd35ec4b80e6f","last_reissued_at":"2026-07-05T08:06:04.224558Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:06:04.224558Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Bicolored point sets admitting non-crossing alternating Hamiltonian paths","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Jan Soukup","submitted_at":"2024-04-09T08:17:00Z","abstract_excerpt":"Consider a bicolored point set $P$ in general position in the plane consisting of $n$ blue and $n$ red points. We show that if a subset of the red points forms the vertices of a convex polygon separating the blue points, lying inside the polygon, from the remaining red points, lying outside the polygon, then the points of $P$ can be connected by non-crossing straight-line segments so that the resulting graph is a properly colored closed Hamiltonian path."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2404.06105","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2404.06105/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2404.06105","created_at":"2026-07-05T08:06:04.224614+00:00"},{"alias_kind":"arxiv_version","alias_value":"2404.06105v1","created_at":"2026-07-05T08:06:04.224614+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2404.06105","created_at":"2026-07-05T08:06:04.224614+00:00"},{"alias_kind":"pith_short_12","alias_value":"Z222WZYYJVIZ","created_at":"2026-07-05T08:06:04.224614+00:00"},{"alias_kind":"pith_short_16","alias_value":"Z222WZYYJVIZQDMX","created_at":"2026-07-05T08:06:04.224614+00:00"},{"alias_kind":"pith_short_8","alias_value":"Z222WZYY","created_at":"2026-07-05T08:06:04.224614+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2506.20421","citing_title":"On plane cycles in geometric multipartite graphs","ref_index":24,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/Z222WZYYJVIZQDMX6GLCFTZM7J","json":"https://pith.science/pith/Z222WZYYJVIZQDMX6GLCFTZM7J.json","graph_json":"https://pith.science/api/pith-number/Z222WZYYJVIZQDMX6GLCFTZM7J/graph.json","events_json":"https://pith.science/api/pith-number/Z222WZYYJVIZQDMX6GLCFTZM7J/events.json","paper":"https://pith.science/paper/Z222WZYY"},"agent_actions":{"view_html":"https://pith.science/pith/Z222WZYYJVIZQDMX6GLCFTZM7J","download_json":"https://pith.science/pith/Z222WZYYJVIZQDMX6GLCFTZM7J.json","view_paper":"https://pith.science/paper/Z222WZYY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2404.06105&json=true","fetch_graph":"https://pith.science/api/pith-number/Z222WZYYJVIZQDMX6GLCFTZM7J/graph.json","fetch_events":"https://pith.science/api/pith-number/Z222WZYYJVIZQDMX6GLCFTZM7J/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/Z222WZYYJVIZQDMX6GLCFTZM7J/action/timestamp_anchor","attest_storage":"https://pith.science/pith/Z222WZYYJVIZQDMX6GLCFTZM7J/action/storage_attestation","attest_author":"https://pith.science/pith/Z222WZYYJVIZQDMX6GLCFTZM7J/action/author_attestation","sign_citation":"https://pith.science/pith/Z222WZYYJVIZQDMX6GLCFTZM7J/action/citation_signature","submit_replication":"https://pith.science/pith/Z222WZYYJVIZQDMX6GLCFTZM7J/action/replication_record"}},"created_at":"2026-07-05T08:06:04.224614+00:00","updated_at":"2026-07-05T08:06:04.224614+00:00"}