{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:UP7VYKP4UHALNVLSS6534A34R5","short_pith_number":"pith:UP7VYKP4","schema_version":"1.0","canonical_sha256":"a3ff5c29fca1c0b6d57297bbbe037c8f59809545c2e9d5c6bf9eac01bc93eedd","source":{"kind":"arxiv","id":"1509.04595","version":1},"attestation_state":"computed","paper":{"title":"Are there any nicely structured preference~profiles~nearby?","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Gerhard J. Woeginger, Jiehua Chen, Robert Bredereck","submitted_at":"2015-09-15T15:08:51Z","abstract_excerpt":"We investigate the problem of deciding whether a given preference profile is close to having a certain nice structure, as for instance single-peaked, single-caved, single-crossing, value-restricted, best-restricted, worst-restricted, medium-restricted, or group-separable profiles. We measure this distance by the number of voters or alternatives that have to be deleted to make the profile a nicely structured one. Our results classify the problem variants with respect to their computational complexity, and draw a clear line between computationally tractable (polynomial-time solvable) and computa"},"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":"1509.04595","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2015-09-15T15:08:51Z","cross_cats_sorted":[],"title_canon_sha256":"3b5b3fc31f20c26e317de9649fa8277f9e516b958e61dfef3efa96da80a8bcf5","abstract_canon_sha256":"0b93b157f7b296e8ee3ffceb2e41f0409fb4eca129a2bcc0a1be01b7ba416454"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:32:58.448554Z","signature_b64":"ejmraZ4mczZwj9pEUKm674M2XQE4SWs15gOLtXLn0MXkKst7N0Hqkbm3TUGa6eYg4cAQ7UC0oiHCjqyJjyK1CA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a3ff5c29fca1c0b6d57297bbbe037c8f59809545c2e9d5c6bf9eac01bc93eedd","last_reissued_at":"2026-05-18T01:32:58.448002Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:32:58.448002Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Are there any nicely structured preference~profiles~nearby?","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Gerhard J. Woeginger, Jiehua Chen, Robert Bredereck","submitted_at":"2015-09-15T15:08:51Z","abstract_excerpt":"We investigate the problem of deciding whether a given preference profile is close to having a certain nice structure, as for instance single-peaked, single-caved, single-crossing, value-restricted, best-restricted, worst-restricted, medium-restricted, or group-separable profiles. We measure this distance by the number of voters or alternatives that have to be deleted to make the profile a nicely structured one. Our results classify the problem variants with respect to their computational complexity, and draw a clear line between computationally tractable (polynomial-time solvable) and computa"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1509.04595","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":"1509.04595","created_at":"2026-05-18T01:32:58.448077+00:00"},{"alias_kind":"arxiv_version","alias_value":"1509.04595v1","created_at":"2026-05-18T01:32:58.448077+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.04595","created_at":"2026-05-18T01:32:58.448077+00:00"},{"alias_kind":"pith_short_12","alias_value":"UP7VYKP4UHAL","created_at":"2026-05-18T12:29:44.643036+00:00"},{"alias_kind":"pith_short_16","alias_value":"UP7VYKP4UHALNVLS","created_at":"2026-05-18T12:29:44.643036+00:00"},{"alias_kind":"pith_short_8","alias_value":"UP7VYKP4","created_at":"2026-05-18T12:29:44.643036+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/UP7VYKP4UHALNVLSS6534A34R5","json":"https://pith.science/pith/UP7VYKP4UHALNVLSS6534A34R5.json","graph_json":"https://pith.science/api/pith-number/UP7VYKP4UHALNVLSS6534A34R5/graph.json","events_json":"https://pith.science/api/pith-number/UP7VYKP4UHALNVLSS6534A34R5/events.json","paper":"https://pith.science/paper/UP7VYKP4"},"agent_actions":{"view_html":"https://pith.science/pith/UP7VYKP4UHALNVLSS6534A34R5","download_json":"https://pith.science/pith/UP7VYKP4UHALNVLSS6534A34R5.json","view_paper":"https://pith.science/paper/UP7VYKP4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1509.04595&json=true","fetch_graph":"https://pith.science/api/pith-number/UP7VYKP4UHALNVLSS6534A34R5/graph.json","fetch_events":"https://pith.science/api/pith-number/UP7VYKP4UHALNVLSS6534A34R5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UP7VYKP4UHALNVLSS6534A34R5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UP7VYKP4UHALNVLSS6534A34R5/action/storage_attestation","attest_author":"https://pith.science/pith/UP7VYKP4UHALNVLSS6534A34R5/action/author_attestation","sign_citation":"https://pith.science/pith/UP7VYKP4UHALNVLSS6534A34R5/action/citation_signature","submit_replication":"https://pith.science/pith/UP7VYKP4UHALNVLSS6534A34R5/action/replication_record"}},"created_at":"2026-05-18T01:32:58.448077+00:00","updated_at":"2026-05-18T01:32:58.448077+00:00"}