{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:5NQXOPJ4WC3W33EV2IUNFYCZJ7","short_pith_number":"pith:5NQXOPJ4","schema_version":"1.0","canonical_sha256":"eb61773d3cb0b76dec95d228d2e0594fc98504c07597a80d3451427774e1b3f3","source":{"kind":"arxiv","id":"1506.03838","version":1},"attestation_state":"computed","paper":{"title":"The one-dimensional Euclidean domain: Finitely many obstructions are not enough","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Gerhard J. Woeginger, Jiehua Chen, Kirk Pruhs","submitted_at":"2015-06-11T21:06:43Z","abstract_excerpt":"We show that one-dimensional Euclidean preference profiles can not be characterized in terms of finitely many forbidden substructures. This result is in strong contrast to the case of single-peaked and single-crossing preference profiles, for which such finite characterizations have been derived in the literature."},"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":"1506.03838","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2015-06-11T21:06:43Z","cross_cats_sorted":[],"title_canon_sha256":"b191892453ffcfe1b4743745d2c29ce131d3faad1f4cf587c262c2e85890e627","abstract_canon_sha256":"f27c31239a49d940ea27ea8484cc603d6dc71ba891ad9a9a877f78c5a33a5f68"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:51:49.094830Z","signature_b64":"BBD6Px9KhZBCwm7UqnIAeJAE3qpsldEmEJZR4mVLWlgzXuz5PwcUhK/9VK2+vryaUeOVqqODRr/oYT/zixMZBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"eb61773d3cb0b76dec95d228d2e0594fc98504c07597a80d3451427774e1b3f3","last_reissued_at":"2026-05-18T01:51:49.094092Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:51:49.094092Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The one-dimensional Euclidean domain: Finitely many obstructions are not enough","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Gerhard J. Woeginger, Jiehua Chen, Kirk Pruhs","submitted_at":"2015-06-11T21:06:43Z","abstract_excerpt":"We show that one-dimensional Euclidean preference profiles can not be characterized in terms of finitely many forbidden substructures. This result is in strong contrast to the case of single-peaked and single-crossing preference profiles, for which such finite characterizations have been derived in the literature."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1506.03838","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":"1506.03838","created_at":"2026-05-18T01:51:49.094225+00:00"},{"alias_kind":"arxiv_version","alias_value":"1506.03838v1","created_at":"2026-05-18T01:51:49.094225+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1506.03838","created_at":"2026-05-18T01:51:49.094225+00:00"},{"alias_kind":"pith_short_12","alias_value":"5NQXOPJ4WC3W","created_at":"2026-05-18T12:29:05.191682+00:00"},{"alias_kind":"pith_short_16","alias_value":"5NQXOPJ4WC3W33EV","created_at":"2026-05-18T12:29:05.191682+00:00"},{"alias_kind":"pith_short_8","alias_value":"5NQXOPJ4","created_at":"2026-05-18T12:29:05.191682+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/5NQXOPJ4WC3W33EV2IUNFYCZJ7","json":"https://pith.science/pith/5NQXOPJ4WC3W33EV2IUNFYCZJ7.json","graph_json":"https://pith.science/api/pith-number/5NQXOPJ4WC3W33EV2IUNFYCZJ7/graph.json","events_json":"https://pith.science/api/pith-number/5NQXOPJ4WC3W33EV2IUNFYCZJ7/events.json","paper":"https://pith.science/paper/5NQXOPJ4"},"agent_actions":{"view_html":"https://pith.science/pith/5NQXOPJ4WC3W33EV2IUNFYCZJ7","download_json":"https://pith.science/pith/5NQXOPJ4WC3W33EV2IUNFYCZJ7.json","view_paper":"https://pith.science/paper/5NQXOPJ4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1506.03838&json=true","fetch_graph":"https://pith.science/api/pith-number/5NQXOPJ4WC3W33EV2IUNFYCZJ7/graph.json","fetch_events":"https://pith.science/api/pith-number/5NQXOPJ4WC3W33EV2IUNFYCZJ7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5NQXOPJ4WC3W33EV2IUNFYCZJ7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5NQXOPJ4WC3W33EV2IUNFYCZJ7/action/storage_attestation","attest_author":"https://pith.science/pith/5NQXOPJ4WC3W33EV2IUNFYCZJ7/action/author_attestation","sign_citation":"https://pith.science/pith/5NQXOPJ4WC3W33EV2IUNFYCZJ7/action/citation_signature","submit_replication":"https://pith.science/pith/5NQXOPJ4WC3W33EV2IUNFYCZJ7/action/replication_record"}},"created_at":"2026-05-18T01:51:49.094225+00:00","updated_at":"2026-05-18T01:51:49.094225+00:00"}