{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:ERGQFTCALK7QIKE5IJKULQEPS5","short_pith_number":"pith:ERGQFTCA","canonical_record":{"source":{"id":"1205.4893","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2012-05-22T12:30:27Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"a985940862f40d15bd34c6e59b1047f0b087a0138ef7a380ba9de568817922d2","abstract_canon_sha256":"a1571afcfebc0005ae22596d2b90effaefc3db8defd7595e4e35aeeec0c7c6ae"},"schema_version":"1.0"},"canonical_sha256":"244d02cc405abf04289d425545c08f9746bcff410baa017bcf9d01b48286842d","source":{"kind":"arxiv","id":"1205.4893","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1205.4893","created_at":"2026-05-18T03:55:11Z"},{"alias_kind":"arxiv_version","alias_value":"1205.4893v1","created_at":"2026-05-18T03:55:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1205.4893","created_at":"2026-05-18T03:55:11Z"},{"alias_kind":"pith_short_12","alias_value":"ERGQFTCALK7Q","created_at":"2026-05-18T12:27:04Z"},{"alias_kind":"pith_short_16","alias_value":"ERGQFTCALK7QIKE5","created_at":"2026-05-18T12:27:04Z"},{"alias_kind":"pith_short_8","alias_value":"ERGQFTCA","created_at":"2026-05-18T12:27:04Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:ERGQFTCALK7QIKE5IJKULQEPS5","target":"record","payload":{"canonical_record":{"source":{"id":"1205.4893","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2012-05-22T12:30:27Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"a985940862f40d15bd34c6e59b1047f0b087a0138ef7a380ba9de568817922d2","abstract_canon_sha256":"a1571afcfebc0005ae22596d2b90effaefc3db8defd7595e4e35aeeec0c7c6ae"},"schema_version":"1.0"},"canonical_sha256":"244d02cc405abf04289d425545c08f9746bcff410baa017bcf9d01b48286842d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:55:11.382829Z","signature_b64":"BjK7U8JgYpUirFRPHmqmhfnbXYiAXfrebLHR5G/H/FC8grG+mkcloWUwjKcqp2VZtJUjkL4TcHwT4X94JuIXCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"244d02cc405abf04289d425545c08f9746bcff410baa017bcf9d01b48286842d","last_reissued_at":"2026-05-18T03:55:11.382389Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:55:11.382389Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1205.4893","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:55:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"x/HYi7QCWd7za+Qc1OB6/kQNs8qY/BtobnSBk5TJZmumYzqBizyYAWbiaov+uI7VbcAujPEG/iQklOcOmX6aBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T07:10:30.282171Z"},"content_sha256":"622b823bfe547fd34880524ce1d70165161773910c5a83c9cc93140176175f4e","schema_version":"1.0","event_id":"sha256:622b823bfe547fd34880524ce1d70165161773910c5a83c9cc93140176175f4e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:ERGQFTCALK7QIKE5IJKULQEPS5","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the practically interesting instances of MAXCUT","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.CC","authors_text":"Amit Daniely, Michael Saks, Nati Linial, Yonatan Bilu","submitted_at":"2012-05-22T12:30:27Z","abstract_excerpt":"The complexity of a computational problem is traditionally quantified based on the hardness of its worst case. This approach has many advantages and has led to a deep and beautiful theory. However, from the practical perspective, this leaves much to be desired. In application areas, practically interesting instances very often occupy just a tiny part of an algorithm's space of instances, and the vast majority of instances are simply irrelevant. Addressing these issues is a major challenge for theoretical computer science which may make theory more relevant to the practice of computer science.\n"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1205.4893","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:55:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"B6qFKCvQHE72hr9C075dxi/7eBGR54JqOQQqF45r48GeU2bKfYqpnoQNGufcFv+tCM5gOfOD79h63oJZAGESAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T07:10:30.282868Z"},"content_sha256":"15a25af6bb87f856412d58f7570a954ecdde5e49b6d5832a86fa5cd315be43a8","schema_version":"1.0","event_id":"sha256:15a25af6bb87f856412d58f7570a954ecdde5e49b6d5832a86fa5cd315be43a8"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ERGQFTCALK7QIKE5IJKULQEPS5/bundle.json","state_url":"https://pith.science/pith/ERGQFTCALK7QIKE5IJKULQEPS5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ERGQFTCALK7QIKE5IJKULQEPS5/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-05-27T07:10:30Z","links":{"resolver":"https://pith.science/pith/ERGQFTCALK7QIKE5IJKULQEPS5","bundle":"https://pith.science/pith/ERGQFTCALK7QIKE5IJKULQEPS5/bundle.json","state":"https://pith.science/pith/ERGQFTCALK7QIKE5IJKULQEPS5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ERGQFTCALK7QIKE5IJKULQEPS5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:ERGQFTCALK7QIKE5IJKULQEPS5","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":"a1571afcfebc0005ae22596d2b90effaefc3db8defd7595e4e35aeeec0c7c6ae","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2012-05-22T12:30:27Z","title_canon_sha256":"a985940862f40d15bd34c6e59b1047f0b087a0138ef7a380ba9de568817922d2"},"schema_version":"1.0","source":{"id":"1205.4893","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1205.4893","created_at":"2026-05-18T03:55:11Z"},{"alias_kind":"arxiv_version","alias_value":"1205.4893v1","created_at":"2026-05-18T03:55:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1205.4893","created_at":"2026-05-18T03:55:11Z"},{"alias_kind":"pith_short_12","alias_value":"ERGQFTCALK7Q","created_at":"2026-05-18T12:27:04Z"},{"alias_kind":"pith_short_16","alias_value":"ERGQFTCALK7QIKE5","created_at":"2026-05-18T12:27:04Z"},{"alias_kind":"pith_short_8","alias_value":"ERGQFTCA","created_at":"2026-05-18T12:27:04Z"}],"graph_snapshots":[{"event_id":"sha256:15a25af6bb87f856412d58f7570a954ecdde5e49b6d5832a86fa5cd315be43a8","target":"graph","created_at":"2026-05-18T03:55:11Z","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":"The complexity of a computational problem is traditionally quantified based on the hardness of its worst case. This approach has many advantages and has led to a deep and beautiful theory. However, from the practical perspective, this leaves much to be desired. In application areas, practically interesting instances very often occupy just a tiny part of an algorithm's space of instances, and the vast majority of instances are simply irrelevant. Addressing these issues is a major challenge for theoretical computer science which may make theory more relevant to the practice of computer science.\n","authors_text":"Amit Daniely, Michael Saks, Nati Linial, Yonatan Bilu","cross_cats":["cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2012-05-22T12:30:27Z","title":"On the practically interesting instances of MAXCUT"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1205.4893","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:622b823bfe547fd34880524ce1d70165161773910c5a83c9cc93140176175f4e","target":"record","created_at":"2026-05-18T03:55:11Z","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":"a1571afcfebc0005ae22596d2b90effaefc3db8defd7595e4e35aeeec0c7c6ae","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2012-05-22T12:30:27Z","title_canon_sha256":"a985940862f40d15bd34c6e59b1047f0b087a0138ef7a380ba9de568817922d2"},"schema_version":"1.0","source":{"id":"1205.4893","kind":"arxiv","version":1}},"canonical_sha256":"244d02cc405abf04289d425545c08f9746bcff410baa017bcf9d01b48286842d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"244d02cc405abf04289d425545c08f9746bcff410baa017bcf9d01b48286842d","first_computed_at":"2026-05-18T03:55:11.382389Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:55:11.382389Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"BjK7U8JgYpUirFRPHmqmhfnbXYiAXfrebLHR5G/H/FC8grG+mkcloWUwjKcqp2VZtJUjkL4TcHwT4X94JuIXCg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:55:11.382829Z","signed_message":"canonical_sha256_bytes"},"source_id":"1205.4893","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:622b823bfe547fd34880524ce1d70165161773910c5a83c9cc93140176175f4e","sha256:15a25af6bb87f856412d58f7570a954ecdde5e49b6d5832a86fa5cd315be43a8"],"state_sha256":"238a2324465827325d5f27ce88a2e8a3dadbc3c12bb122cb1fa7b3d43ad132c2"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xLsNmL4l96tqVK/iWrj4Fq5PslOkML97Oi4VJvp1ZHDxbaFAsJCyZUsTpw9DetbsDqaFZAkvuc7UGuW9h2BBBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T07:10:30.286771Z","bundle_sha256":"2948d9ffdfe0eecb8cca99d007defce0a23457df25339c8b26a108f56c902bf3"}}