{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:VWEVQEXQ6PXP7VV3XCLHKNBYRN","short_pith_number":"pith:VWEVQEXQ","canonical_record":{"source":{"id":"1210.1890","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-10-05T23:22:20Z","cross_cats_sorted":[],"title_canon_sha256":"8a97526e71d35cd4126f8df0e7cfa3852211c935bca1e7717c80d8fcf9bbe673","abstract_canon_sha256":"44585a42b6a778ac6961bcdf28c737ccef9d0a2476641a9f8ea2fe44b6260878"},"schema_version":"1.0"},"canonical_sha256":"ad895812f0f3eeffd6bbb8967534388b76e261881e2ba8ad8c77cda2df3e16a7","source":{"kind":"arxiv","id":"1210.1890","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1210.1890","created_at":"2026-05-18T03:32:05Z"},{"alias_kind":"arxiv_version","alias_value":"1210.1890v2","created_at":"2026-05-18T03:32:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1210.1890","created_at":"2026-05-18T03:32:05Z"},{"alias_kind":"pith_short_12","alias_value":"VWEVQEXQ6PXP","created_at":"2026-05-18T12:27:25Z"},{"alias_kind":"pith_short_16","alias_value":"VWEVQEXQ6PXP7VV3","created_at":"2026-05-18T12:27:25Z"},{"alias_kind":"pith_short_8","alias_value":"VWEVQEXQ","created_at":"2026-05-18T12:27:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:VWEVQEXQ6PXP7VV3XCLHKNBYRN","target":"record","payload":{"canonical_record":{"source":{"id":"1210.1890","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-10-05T23:22:20Z","cross_cats_sorted":[],"title_canon_sha256":"8a97526e71d35cd4126f8df0e7cfa3852211c935bca1e7717c80d8fcf9bbe673","abstract_canon_sha256":"44585a42b6a778ac6961bcdf28c737ccef9d0a2476641a9f8ea2fe44b6260878"},"schema_version":"1.0"},"canonical_sha256":"ad895812f0f3eeffd6bbb8967534388b76e261881e2ba8ad8c77cda2df3e16a7","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:32:05.234774Z","signature_b64":"Exp0XWxG63YjgNM6uS8Jjk50u0bf4YoI9N7c1JWf4r0SfuuJBe26eeai0TaM3SAzoBQ8/M+QzO3/nD7dkTHeAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ad895812f0f3eeffd6bbb8967534388b76e261881e2ba8ad8c77cda2df3e16a7","last_reissued_at":"2026-05-18T03:32:05.234081Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:32:05.234081Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1210.1890","source_version":2,"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:32:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nuDeR1hqxbhecAvdF1GVRrNswLn3vXngHvaPD5JzmycXcoi8f3vxziVpBqMvA1G772eotLznrDzeKZJh5i/2Dw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-04T16:15:04.963177Z"},"content_sha256":"ccb67a9a373abcd7d2fe664cbcefd771ba89becdcbb4ddd2722c65d05cbf5aa6","schema_version":"1.0","event_id":"sha256:ccb67a9a373abcd7d2fe664cbcefd771ba89becdcbb4ddd2722c65d05cbf5aa6"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:VWEVQEXQ6PXP7VV3XCLHKNBYRN","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Local Search is Better than Random Assignment for Bounded Occurrence Ordering k-CSPs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Konstantin Makarychev","submitted_at":"2012-10-05T23:22:20Z","abstract_excerpt":"We prove that the Bounded Occurrence Ordering k-CSP Problem is not approximation resistant. We give a very simple local search algorithm that always performs better than the random assignment algorithm. Specifically, the expected value of the solution returned by the algorithm is at least Alg > Avg + a(B,k) (Opt - Avg), where \"Opt\" is the value of the optimal solution; \"Avg\" is the expected value of the random solution; and a(B,k)=Omega_k(B^{-(k+O(1))} is a parameter depending only on \"k\" (the arity of the CSP) and \"B\" (the maximum number of times each variable is used in constraints). The que"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1210.1890","kind":"arxiv","version":2},"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:32:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bGxMxKKOxaoDfx2EYsNglWhdcvlw1ahZBa1NYYZv6JtmPPKWqDBaYnhe8qpUsK0oL0QX/5lqUCBbd8Ut0ry/Ag==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-04T16:15:04.963620Z"},"content_sha256":"e6f3811f6683f6277700c9a8103e8ae4d3daabae4f49c5ea53d9dd20330b5369","schema_version":"1.0","event_id":"sha256:e6f3811f6683f6277700c9a8103e8ae4d3daabae4f49c5ea53d9dd20330b5369"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VWEVQEXQ6PXP7VV3XCLHKNBYRN/bundle.json","state_url":"https://pith.science/pith/VWEVQEXQ6PXP7VV3XCLHKNBYRN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VWEVQEXQ6PXP7VV3XCLHKNBYRN/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-08-04T16:15:04Z","links":{"resolver":"https://pith.science/pith/VWEVQEXQ6PXP7VV3XCLHKNBYRN","bundle":"https://pith.science/pith/VWEVQEXQ6PXP7VV3XCLHKNBYRN/bundle.json","state":"https://pith.science/pith/VWEVQEXQ6PXP7VV3XCLHKNBYRN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VWEVQEXQ6PXP7VV3XCLHKNBYRN/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:VWEVQEXQ6PXP7VV3XCLHKNBYRN","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":"44585a42b6a778ac6961bcdf28c737ccef9d0a2476641a9f8ea2fe44b6260878","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-10-05T23:22:20Z","title_canon_sha256":"8a97526e71d35cd4126f8df0e7cfa3852211c935bca1e7717c80d8fcf9bbe673"},"schema_version":"1.0","source":{"id":"1210.1890","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1210.1890","created_at":"2026-05-18T03:32:05Z"},{"alias_kind":"arxiv_version","alias_value":"1210.1890v2","created_at":"2026-05-18T03:32:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1210.1890","created_at":"2026-05-18T03:32:05Z"},{"alias_kind":"pith_short_12","alias_value":"VWEVQEXQ6PXP","created_at":"2026-05-18T12:27:25Z"},{"alias_kind":"pith_short_16","alias_value":"VWEVQEXQ6PXP7VV3","created_at":"2026-05-18T12:27:25Z"},{"alias_kind":"pith_short_8","alias_value":"VWEVQEXQ","created_at":"2026-05-18T12:27:25Z"}],"graph_snapshots":[{"event_id":"sha256:e6f3811f6683f6277700c9a8103e8ae4d3daabae4f49c5ea53d9dd20330b5369","target":"graph","created_at":"2026-05-18T03:32: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 prove that the Bounded Occurrence Ordering k-CSP Problem is not approximation resistant. We give a very simple local search algorithm that always performs better than the random assignment algorithm. Specifically, the expected value of the solution returned by the algorithm is at least Alg > Avg + a(B,k) (Opt - Avg), where \"Opt\" is the value of the optimal solution; \"Avg\" is the expected value of the random solution; and a(B,k)=Omega_k(B^{-(k+O(1))} is a parameter depending only on \"k\" (the arity of the CSP) and \"B\" (the maximum number of times each variable is used in constraints). The que","authors_text":"Konstantin Makarychev","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-10-05T23:22:20Z","title":"Local Search is Better than Random Assignment for Bounded Occurrence Ordering k-CSPs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1210.1890","kind":"arxiv","version":2},"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:ccb67a9a373abcd7d2fe664cbcefd771ba89becdcbb4ddd2722c65d05cbf5aa6","target":"record","created_at":"2026-05-18T03:32: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":"44585a42b6a778ac6961bcdf28c737ccef9d0a2476641a9f8ea2fe44b6260878","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-10-05T23:22:20Z","title_canon_sha256":"8a97526e71d35cd4126f8df0e7cfa3852211c935bca1e7717c80d8fcf9bbe673"},"schema_version":"1.0","source":{"id":"1210.1890","kind":"arxiv","version":2}},"canonical_sha256":"ad895812f0f3eeffd6bbb8967534388b76e261881e2ba8ad8c77cda2df3e16a7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ad895812f0f3eeffd6bbb8967534388b76e261881e2ba8ad8c77cda2df3e16a7","first_computed_at":"2026-05-18T03:32:05.234081Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:32:05.234081Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Exp0XWxG63YjgNM6uS8Jjk50u0bf4YoI9N7c1JWf4r0SfuuJBe26eeai0TaM3SAzoBQ8/M+QzO3/nD7dkTHeAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:32:05.234774Z","signed_message":"canonical_sha256_bytes"},"source_id":"1210.1890","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ccb67a9a373abcd7d2fe664cbcefd771ba89becdcbb4ddd2722c65d05cbf5aa6","sha256:e6f3811f6683f6277700c9a8103e8ae4d3daabae4f49c5ea53d9dd20330b5369"],"state_sha256":"aaab87e655498f796406b14bde5cd18f710ee650a7d103dfd0a0c9bf1df2688e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WpcsZM6C6BEQoSflbK6ZVOep+PnmCMdf7ytp0RobV1vLTGxc61aQmyLwSrWTSfEl1uIyQ1TsIcuiMmN+0+0NAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-04T16:15:04.967016Z","bundle_sha256":"6e7cd2a352820a0750c32f7ced27403e984ac3d41296cba4667cf6d23b4fb5ea"}}