{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:SVPAI2YOZAN3UA4NUQ4XRWPTLQ","short_pith_number":"pith:SVPAI2YO","schema_version":"1.0","canonical_sha256":"955e046b0ec81bba038da43978d9f35c21da1d3e70d7d6688e67ef9259919ec6","source":{"kind":"arxiv","id":"1709.06805","version":3},"attestation_state":"computed","paper":{"title":"Complexity of Finding Perfect Bipartite Matchings Minimizing the Number of Intersecting Edges","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Grzegorz Gu\\'spiel","submitted_at":"2017-09-20T10:42:53Z","abstract_excerpt":"Consider a problem where we are given a bipartite graph H with vertices arranged on two horizontal lines in the plane, such that the two sets of vertices placed on the two lines form a bipartition of H. We additionally require that H admits a perfect matching and assume that edges of H are embedded in the plane as segments. The goal is to compute the minimal number of intersecting edges in a perfect matching in H. The problem stems from so-called token swapping problems, introduced by Yamanaka et al. [3] and generalized by Bonnet, Miltzow and Rzazewski [1]. We show that our problem, equivalent"},"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":"1709.06805","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2017-09-20T10:42:53Z","cross_cats_sorted":[],"title_canon_sha256":"e83dbec8769775a8e47be2c12a18fd8f686ad03defa192304002ff675425558a","abstract_canon_sha256":"84b6506ce068a52438cf449fda766b230484039e99204690e1a8c636dc81e977"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:27:18.918743Z","signature_b64":"TCFcu8lxjy//musx3Ta61tI17freaEg2mzHXU9cillpNUlAfwlIBAuxf92ozjK7lgK1NBwvsqF9et+6jTGokBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"955e046b0ec81bba038da43978d9f35c21da1d3e70d7d6688e67ef9259919ec6","last_reissued_at":"2026-05-18T00:27:18.918211Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:27:18.918211Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Complexity of Finding Perfect Bipartite Matchings Minimizing the Number of Intersecting Edges","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Grzegorz Gu\\'spiel","submitted_at":"2017-09-20T10:42:53Z","abstract_excerpt":"Consider a problem where we are given a bipartite graph H with vertices arranged on two horizontal lines in the plane, such that the two sets of vertices placed on the two lines form a bipartition of H. We additionally require that H admits a perfect matching and assume that edges of H are embedded in the plane as segments. The goal is to compute the minimal number of intersecting edges in a perfect matching in H. The problem stems from so-called token swapping problems, introduced by Yamanaka et al. [3] and generalized by Bonnet, Miltzow and Rzazewski [1]. We show that our problem, equivalent"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.06805","kind":"arxiv","version":3},"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":"1709.06805","created_at":"2026-05-18T00:27:18.918296+00:00"},{"alias_kind":"arxiv_version","alias_value":"1709.06805v3","created_at":"2026-05-18T00:27:18.918296+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.06805","created_at":"2026-05-18T00:27:18.918296+00:00"},{"alias_kind":"pith_short_12","alias_value":"SVPAI2YOZAN3","created_at":"2026-05-18T12:31:43.269735+00:00"},{"alias_kind":"pith_short_16","alias_value":"SVPAI2YOZAN3UA4N","created_at":"2026-05-18T12:31:43.269735+00:00"},{"alias_kind":"pith_short_8","alias_value":"SVPAI2YO","created_at":"2026-05-18T12:31:43.269735+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/SVPAI2YOZAN3UA4NUQ4XRWPTLQ","json":"https://pith.science/pith/SVPAI2YOZAN3UA4NUQ4XRWPTLQ.json","graph_json":"https://pith.science/api/pith-number/SVPAI2YOZAN3UA4NUQ4XRWPTLQ/graph.json","events_json":"https://pith.science/api/pith-number/SVPAI2YOZAN3UA4NUQ4XRWPTLQ/events.json","paper":"https://pith.science/paper/SVPAI2YO"},"agent_actions":{"view_html":"https://pith.science/pith/SVPAI2YOZAN3UA4NUQ4XRWPTLQ","download_json":"https://pith.science/pith/SVPAI2YOZAN3UA4NUQ4XRWPTLQ.json","view_paper":"https://pith.science/paper/SVPAI2YO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1709.06805&json=true","fetch_graph":"https://pith.science/api/pith-number/SVPAI2YOZAN3UA4NUQ4XRWPTLQ/graph.json","fetch_events":"https://pith.science/api/pith-number/SVPAI2YOZAN3UA4NUQ4XRWPTLQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SVPAI2YOZAN3UA4NUQ4XRWPTLQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SVPAI2YOZAN3UA4NUQ4XRWPTLQ/action/storage_attestation","attest_author":"https://pith.science/pith/SVPAI2YOZAN3UA4NUQ4XRWPTLQ/action/author_attestation","sign_citation":"https://pith.science/pith/SVPAI2YOZAN3UA4NUQ4XRWPTLQ/action/citation_signature","submit_replication":"https://pith.science/pith/SVPAI2YOZAN3UA4NUQ4XRWPTLQ/action/replication_record"}},"created_at":"2026-05-18T00:27:18.918296+00:00","updated_at":"2026-05-18T00:27:18.918296+00:00"}