{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:JDB3PD7D7JVU2H6POPTWJFRZTN","short_pith_number":"pith:JDB3PD7D","schema_version":"1.0","canonical_sha256":"48c3b78fe3fa6b4d1fcf73e76496399b58fbdd21a0769cf7267b82d13985e2ad","source":{"kind":"arxiv","id":"1903.03014","version":1},"attestation_state":"computed","paper":{"title":"An Experimental Study of Forbidden Patterns in Geometric Permutations by Combinatorial Lifting","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Andreas Holmsen, Cyril Nicaud, Xavier Goaoc","submitted_at":"2019-03-07T16:02:20Z","abstract_excerpt":"We study the problem of deciding if a given triple of permutations can be realized as geometric permutations of disjoint convex sets in $\\mathbb{R}^3$. We show that this question, which is equivalent to deciding the emptiness of certain semi-algebraic sets bounded by cubic polynomials, can be \"lifted\" to a purely combinatorial problem. We propose an effective algorithm for that problem, and use it to gain new insights into the structure of geometric permutations."},"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":"1903.03014","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2019-03-07T16:02:20Z","cross_cats_sorted":[],"title_canon_sha256":"7fdd6a135c0d708a10510e60aadf24d627b4d6acde44ff3cfe685216d076359a","abstract_canon_sha256":"019ba257e41c26892ed67313a56d2916de78da26482b8a99955a7ba54566f120"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:51:50.408143Z","signature_b64":"JcQHkA0nt9Z8tHIZxhtGMtdOUw7U8kBxTcunv1GYwdCmgTEgoy7swtf0C1V/DYEzyjsPNuG4iarUORm5vBK5CQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"48c3b78fe3fa6b4d1fcf73e76496399b58fbdd21a0769cf7267b82d13985e2ad","last_reissued_at":"2026-05-17T23:51:50.407435Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:51:50.407435Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"An Experimental Study of Forbidden Patterns in Geometric Permutations by Combinatorial Lifting","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Andreas Holmsen, Cyril Nicaud, Xavier Goaoc","submitted_at":"2019-03-07T16:02:20Z","abstract_excerpt":"We study the problem of deciding if a given triple of permutations can be realized as geometric permutations of disjoint convex sets in $\\mathbb{R}^3$. We show that this question, which is equivalent to deciding the emptiness of certain semi-algebraic sets bounded by cubic polynomials, can be \"lifted\" to a purely combinatorial problem. We propose an effective algorithm for that problem, and use it to gain new insights into the structure of geometric permutations."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.03014","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":"1903.03014","created_at":"2026-05-17T23:51:50.407574+00:00"},{"alias_kind":"arxiv_version","alias_value":"1903.03014v1","created_at":"2026-05-17T23:51:50.407574+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.03014","created_at":"2026-05-17T23:51:50.407574+00:00"},{"alias_kind":"pith_short_12","alias_value":"JDB3PD7D7JVU","created_at":"2026-05-18T12:33:18.533446+00:00"},{"alias_kind":"pith_short_16","alias_value":"JDB3PD7D7JVU2H6P","created_at":"2026-05-18T12:33:18.533446+00:00"},{"alias_kind":"pith_short_8","alias_value":"JDB3PD7D","created_at":"2026-05-18T12:33:18.533446+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/JDB3PD7D7JVU2H6POPTWJFRZTN","json":"https://pith.science/pith/JDB3PD7D7JVU2H6POPTWJFRZTN.json","graph_json":"https://pith.science/api/pith-number/JDB3PD7D7JVU2H6POPTWJFRZTN/graph.json","events_json":"https://pith.science/api/pith-number/JDB3PD7D7JVU2H6POPTWJFRZTN/events.json","paper":"https://pith.science/paper/JDB3PD7D"},"agent_actions":{"view_html":"https://pith.science/pith/JDB3PD7D7JVU2H6POPTWJFRZTN","download_json":"https://pith.science/pith/JDB3PD7D7JVU2H6POPTWJFRZTN.json","view_paper":"https://pith.science/paper/JDB3PD7D","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1903.03014&json=true","fetch_graph":"https://pith.science/api/pith-number/JDB3PD7D7JVU2H6POPTWJFRZTN/graph.json","fetch_events":"https://pith.science/api/pith-number/JDB3PD7D7JVU2H6POPTWJFRZTN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JDB3PD7D7JVU2H6POPTWJFRZTN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JDB3PD7D7JVU2H6POPTWJFRZTN/action/storage_attestation","attest_author":"https://pith.science/pith/JDB3PD7D7JVU2H6POPTWJFRZTN/action/author_attestation","sign_citation":"https://pith.science/pith/JDB3PD7D7JVU2H6POPTWJFRZTN/action/citation_signature","submit_replication":"https://pith.science/pith/JDB3PD7D7JVU2H6POPTWJFRZTN/action/replication_record"}},"created_at":"2026-05-17T23:51:50.407574+00:00","updated_at":"2026-05-17T23:51:50.407574+00:00"}