{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:LOYDRH5BTZQ4L45FPDLICHV5EU","short_pith_number":"pith:LOYDRH5B","schema_version":"1.0","canonical_sha256":"5bb0389fa19e61c5f3a578d6811ebd253a23d5cf6136a5a8fa649e20bdf80897","source":{"kind":"arxiv","id":"2506.20421","version":1},"attestation_state":"computed","paper":{"title":"On plane cycles in geometric multipartite graphs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.CG","authors_text":"Alexandra Weinberger, Andr\\'e Schulz, Jonathan Rollin, Marco Ricci","submitted_at":"2025-06-25T13:36:01Z","abstract_excerpt":"A geometric graph is a drawing of a graph in the plane where the vertices are drawn as points in general position and the edges as straight-line segments connecting their endpoints. It is plane if it contains no crossing edges. We study plane cycles in geometric complete multipartite graphs. We prove that if a geometric complete multipartite graph contains a plane cycle of length $t$, with $t \\geq 6$, it also contains a smaller plane cycle of length at least $\\lfloor t/2\\rfloor + 1$. We further give a characterization of geometric complete multipartite graphs that contain plane cycles with a c"},"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":"2506.20421","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CG","submitted_at":"2025-06-25T13:36:01Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"482931f82846b19a1d97447ab4ec64d1c3999f43f8476b1b2b25f38033f6323a","abstract_canon_sha256":"e9de17eb50565c6c28dbcdb858a72ae9621e4ac2838d8d378b7c095aa3e910df"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:27:05.284253Z","signature_b64":"1dl3qLUUkh+ESchCAXb+boGclPjSoMr8nPEBWFNdGetD7IKUu4BM7mK4hV2nTsOidXE6ZSjk/BjSYlAj2KHICw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5bb0389fa19e61c5f3a578d6811ebd253a23d5cf6136a5a8fa649e20bdf80897","last_reissued_at":"2026-07-05T11:27:05.283761Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:27:05.283761Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On plane cycles in geometric multipartite graphs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.CG","authors_text":"Alexandra Weinberger, Andr\\'e Schulz, Jonathan Rollin, Marco Ricci","submitted_at":"2025-06-25T13:36:01Z","abstract_excerpt":"A geometric graph is a drawing of a graph in the plane where the vertices are drawn as points in general position and the edges as straight-line segments connecting their endpoints. It is plane if it contains no crossing edges. We study plane cycles in geometric complete multipartite graphs. We prove that if a geometric complete multipartite graph contains a plane cycle of length $t$, with $t \\geq 6$, it also contains a smaller plane cycle of length at least $\\lfloor t/2\\rfloor + 1$. We further give a characterization of geometric complete multipartite graphs that contain plane cycles with a c"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2506.20421","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/2506.20421/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":"2506.20421","created_at":"2026-07-05T11:27:05.283818+00:00"},{"alias_kind":"arxiv_version","alias_value":"2506.20421v1","created_at":"2026-07-05T11:27:05.283818+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2506.20421","created_at":"2026-07-05T11:27:05.283818+00:00"},{"alias_kind":"pith_short_12","alias_value":"LOYDRH5BTZQ4","created_at":"2026-07-05T11:27:05.283818+00:00"},{"alias_kind":"pith_short_16","alias_value":"LOYDRH5BTZQ4L45F","created_at":"2026-07-05T11:27:05.283818+00:00"},{"alias_kind":"pith_short_8","alias_value":"LOYDRH5B","created_at":"2026-07-05T11:27:05.283818+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/LOYDRH5BTZQ4L45FPDLICHV5EU","json":"https://pith.science/pith/LOYDRH5BTZQ4L45FPDLICHV5EU.json","graph_json":"https://pith.science/api/pith-number/LOYDRH5BTZQ4L45FPDLICHV5EU/graph.json","events_json":"https://pith.science/api/pith-number/LOYDRH5BTZQ4L45FPDLICHV5EU/events.json","paper":"https://pith.science/paper/LOYDRH5B"},"agent_actions":{"view_html":"https://pith.science/pith/LOYDRH5BTZQ4L45FPDLICHV5EU","download_json":"https://pith.science/pith/LOYDRH5BTZQ4L45FPDLICHV5EU.json","view_paper":"https://pith.science/paper/LOYDRH5B","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2506.20421&json=true","fetch_graph":"https://pith.science/api/pith-number/LOYDRH5BTZQ4L45FPDLICHV5EU/graph.json","fetch_events":"https://pith.science/api/pith-number/LOYDRH5BTZQ4L45FPDLICHV5EU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LOYDRH5BTZQ4L45FPDLICHV5EU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LOYDRH5BTZQ4L45FPDLICHV5EU/action/storage_attestation","attest_author":"https://pith.science/pith/LOYDRH5BTZQ4L45FPDLICHV5EU/action/author_attestation","sign_citation":"https://pith.science/pith/LOYDRH5BTZQ4L45FPDLICHV5EU/action/citation_signature","submit_replication":"https://pith.science/pith/LOYDRH5BTZQ4L45FPDLICHV5EU/action/replication_record"}},"created_at":"2026-07-05T11:27:05.283818+00:00","updated_at":"2026-07-05T11:27:05.283818+00:00"}