{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:ZEYYUVEDXSGKMVZAPAIFZJUCLA","short_pith_number":"pith:ZEYYUVED","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"},"canonical_sha256":"c9318a5483bc8ca6572078105ca68258290e6072ed5594c182a52de453cf168c","source":{"kind":"arxiv","id":"1307.5090","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1307.5090","created_at":"2026-05-18T03:18:05Z"},{"alias_kind":"arxiv_version","alias_value":"1307.5090v1","created_at":"2026-05-18T03:18:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1307.5090","created_at":"2026-05-18T03:18:05Z"},{"alias_kind":"pith_short_12","alias_value":"ZEYYUVEDXSGK","created_at":"2026-05-18T12:28:09Z"},{"alias_kind":"pith_short_16","alias_value":"ZEYYUVEDXSGKMVZA","created_at":"2026-05-18T12:28:09Z"},{"alias_kind":"pith_short_8","alias_value":"ZEYYUVED","created_at":"2026-05-18T12:28:09Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:ZEYYUVEDXSGKMVZAPAIFZJUCLA","target":"record","payload":{"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"},"canonical_sha256":"c9318a5483bc8ca6572078105ca68258290e6072ed5594c182a52de453cf168c","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"},"source_kind":"arxiv","source_id":"1307.5090","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T03:18:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FVMitWLJDgWsxImobVx2SHNXslwWzzZWuNJ4/Szb5rzqEFxDB91E2CSWqJQz/2z2n3r2kJH7SqunXFzi5EQJCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T14:03:10.553683Z"},"content_sha256":"58ac8394e74ce126964ead81cb01a532bb0f0d2c5b5c4f3cfd3ec936db2bbc9f","schema_version":"1.0","event_id":"sha256:58ac8394e74ce126964ead81cb01a532bb0f0d2c5b5c4f3cfd3ec936db2bbc9f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:ZEYYUVEDXSGKMVZAPAIFZJUCLA","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T03:18:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8lIBCoO0WqGkS2ruSjnYm2aZvvWOvt4LO+fI06wDNgJvavFBwyDLcSsNSXufdc5D80RCwCna61pixLi1h3pRBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T14:03:10.554060Z"},"content_sha256":"55b8600dcf86db14ead653a34f3ec16ff5da81e8a3a2fdcd8876bbf7639be224","schema_version":"1.0","event_id":"sha256:55b8600dcf86db14ead653a34f3ec16ff5da81e8a3a2fdcd8876bbf7639be224"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZEYYUVEDXSGKMVZAPAIFZJUCLA/bundle.json","state_url":"https://pith.science/pith/ZEYYUVEDXSGKMVZAPAIFZJUCLA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZEYYUVEDXSGKMVZAPAIFZJUCLA/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-01T14:03:10Z","links":{"resolver":"https://pith.science/pith/ZEYYUVEDXSGKMVZAPAIFZJUCLA","bundle":"https://pith.science/pith/ZEYYUVEDXSGKMVZAPAIFZJUCLA/bundle.json","state":"https://pith.science/pith/ZEYYUVEDXSGKMVZAPAIFZJUCLA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZEYYUVEDXSGKMVZAPAIFZJUCLA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:ZEYYUVEDXSGKMVZAPAIFZJUCLA","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"fb257f01466ace29c1fb22bc8cc1f4aa29477791a8b0612ac4db3399e13bf7c0","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2013-07-18T21:54:04Z","title_canon_sha256":"3792779b9fe3cf4e66a2519346e305f7eedcdef7f94020335205070f6a278511"},"schema_version":"1.0","source":{"id":"1307.5090","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1307.5090","created_at":"2026-05-18T03:18:05Z"},{"alias_kind":"arxiv_version","alias_value":"1307.5090v1","created_at":"2026-05-18T03:18:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1307.5090","created_at":"2026-05-18T03:18:05Z"},{"alias_kind":"pith_short_12","alias_value":"ZEYYUVEDXSGK","created_at":"2026-05-18T12:28:09Z"},{"alias_kind":"pith_short_16","alias_value":"ZEYYUVEDXSGKMVZA","created_at":"2026-05-18T12:28:09Z"},{"alias_kind":"pith_short_8","alias_value":"ZEYYUVED","created_at":"2026-05-18T12:28:09Z"}],"graph_snapshots":[{"event_id":"sha256:55b8600dcf86db14ead653a34f3ec16ff5da81e8a3a2fdcd8876bbf7639be224","target":"graph","created_at":"2026-05-18T03:18:05Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Cenny Wenner, Per Austrin, Rajsekar Manokaran","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2013-07-18T21:54:04Z","title":"On the NP-Hardness of Approximating Ordering Constraint Satisfaction Problems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1307.5090","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:58ac8394e74ce126964ead81cb01a532bb0f0d2c5b5c4f3cfd3ec936db2bbc9f","target":"record","created_at":"2026-05-18T03:18:05Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"fb257f01466ace29c1fb22bc8cc1f4aa29477791a8b0612ac4db3399e13bf7c0","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2013-07-18T21:54:04Z","title_canon_sha256":"3792779b9fe3cf4e66a2519346e305f7eedcdef7f94020335205070f6a278511"},"schema_version":"1.0","source":{"id":"1307.5090","kind":"arxiv","version":1}},"canonical_sha256":"c9318a5483bc8ca6572078105ca68258290e6072ed5594c182a52de453cf168c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c9318a5483bc8ca6572078105ca68258290e6072ed5594c182a52de453cf168c","first_computed_at":"2026-05-18T03:18:05.703737Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:18:05.703737Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"+X6z1zFMZSDUNSsKRMS0ugoMU5z12LwMkCs/duBm1qg1qll+x27Ivd8ODrN5lR88Ikn+ROMtmcm25Pl3hEYjBw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:18:05.704178Z","signed_message":"canonical_sha256_bytes"},"source_id":"1307.5090","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:58ac8394e74ce126964ead81cb01a532bb0f0d2c5b5c4f3cfd3ec936db2bbc9f","sha256:55b8600dcf86db14ead653a34f3ec16ff5da81e8a3a2fdcd8876bbf7639be224"],"state_sha256":"7828eaf4bb5e99504667844f908a9d025f6e4edd78c1d43bd80bff75ba21895b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4/1qbXaQmUPsPxyVsznosOy8xLRET0ztfZsOPePnmxSHtEP0gSt7vEMu0dKXdozMzfwAwFEz12vrWf1HXZrbAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T14:03:10.556186Z","bundle_sha256":"bda68e9bad29cc8e0c65a35e22afc0814c09f96d35e41ae813e133a8db31dfdd"}}