{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:ZEYYUVEDXSGKMVZAPAIFZJUCLA","short_pith_number":"pith:ZEYYUVED","schema_version":"1.0","canonical_sha256":"c9318a5483bc8ca6572078105ca68258290e6072ed5594c182a52de453cf168c","source":{"kind":"arxiv","id":"1307.5090","version":1},"attestation_state":"computed","paper":{"title":"On the NP-Hardness of Approximating Ordering Constraint Satisfaction Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Cenny Wenner, Per Austrin, Rajsekar Manokaran","submitted_at":"2013-07-18T21:54:04Z","abstract_excerpt":"We show improved NP-hardness of approximating Ordering Constraint Satisfaction Problems (OCSPs). For the two most well-studied OCSPs, Maximum Acyclic Subgraph and Maximum Betweenness, we prove inapproximability of $14/15+\\epsilon$ and $1/2+\\epsilon$.\n  An OCSP is said to be approximation resistant if it is hard to approximate better than taking a uniformly random ordering. We prove that the Maximum Non-Betweenness Problem is approximation resistant and that there are width-$m$ approximation-resistant OCSPs accepting only a fraction $1 / (m/2)!$ of assignments. These results provide the first e"},"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":"1307.5090","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2013-07-18T21:54:04Z","cross_cats_sorted":[],"title_canon_sha256":"3792779b9fe3cf4e66a2519346e305f7eedcdef7f94020335205070f6a278511","abstract_canon_sha256":"fb257f01466ace29c1fb22bc8cc1f4aa29477791a8b0612ac4db3399e13bf7c0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:18:05.704178Z","signature_b64":"+X6z1zFMZSDUNSsKRMS0ugoMU5z12LwMkCs/duBm1qg1qll+x27Ivd8ODrN5lR88Ikn+ROMtmcm25Pl3hEYjBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c9318a5483bc8ca6572078105ca68258290e6072ed5594c182a52de453cf168c","last_reissued_at":"2026-05-18T03:18:05.703737Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:18:05.703737Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the NP-Hardness of Approximating Ordering Constraint Satisfaction Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Cenny Wenner, Per Austrin, Rajsekar Manokaran","submitted_at":"2013-07-18T21:54:04Z","abstract_excerpt":"We show improved NP-hardness of approximating Ordering Constraint Satisfaction Problems (OCSPs). For the two most well-studied OCSPs, Maximum Acyclic Subgraph and Maximum Betweenness, we prove inapproximability of $14/15+\\epsilon$ and $1/2+\\epsilon$.\n  An OCSP is said to be approximation resistant if it is hard to approximate better than taking a uniformly random ordering. We prove that the Maximum Non-Betweenness Problem is approximation resistant and that there are width-$m$ approximation-resistant OCSPs accepting only a fraction $1 / (m/2)!$ of assignments. These results provide the first e"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1307.5090","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":"1307.5090","created_at":"2026-05-18T03:18:05.703809+00:00"},{"alias_kind":"arxiv_version","alias_value":"1307.5090v1","created_at":"2026-05-18T03:18:05.703809+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1307.5090","created_at":"2026-05-18T03:18:05.703809+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZEYYUVEDXSGK","created_at":"2026-05-18T12:28:09.283467+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZEYYUVEDXSGKMVZA","created_at":"2026-05-18T12:28:09.283467+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZEYYUVED","created_at":"2026-05-18T12:28:09.283467+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/ZEYYUVEDXSGKMVZAPAIFZJUCLA","json":"https://pith.science/pith/ZEYYUVEDXSGKMVZAPAIFZJUCLA.json","graph_json":"https://pith.science/api/pith-number/ZEYYUVEDXSGKMVZAPAIFZJUCLA/graph.json","events_json":"https://pith.science/api/pith-number/ZEYYUVEDXSGKMVZAPAIFZJUCLA/events.json","paper":"https://pith.science/paper/ZEYYUVED"},"agent_actions":{"view_html":"https://pith.science/pith/ZEYYUVEDXSGKMVZAPAIFZJUCLA","download_json":"https://pith.science/pith/ZEYYUVEDXSGKMVZAPAIFZJUCLA.json","view_paper":"https://pith.science/paper/ZEYYUVED","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1307.5090&json=true","fetch_graph":"https://pith.science/api/pith-number/ZEYYUVEDXSGKMVZAPAIFZJUCLA/graph.json","fetch_events":"https://pith.science/api/pith-number/ZEYYUVEDXSGKMVZAPAIFZJUCLA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZEYYUVEDXSGKMVZAPAIFZJUCLA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZEYYUVEDXSGKMVZAPAIFZJUCLA/action/storage_attestation","attest_author":"https://pith.science/pith/ZEYYUVEDXSGKMVZAPAIFZJUCLA/action/author_attestation","sign_citation":"https://pith.science/pith/ZEYYUVEDXSGKMVZAPAIFZJUCLA/action/citation_signature","submit_replication":"https://pith.science/pith/ZEYYUVEDXSGKMVZAPAIFZJUCLA/action/replication_record"}},"created_at":"2026-05-18T03:18:05.703809+00:00","updated_at":"2026-05-18T03:18:05.703809+00:00"}