{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:ERGQFTCALK7QIKE5IJKULQEPS5","short_pith_number":"pith:ERGQFTCA","schema_version":"1.0","canonical_sha256":"244d02cc405abf04289d425545c08f9746bcff410baa017bcf9d01b48286842d","source":{"kind":"arxiv","id":"1205.4893","version":1},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1205.4893","created_at":"2026-05-18T03:55:11.382455+00:00"},{"alias_kind":"arxiv_version","alias_value":"1205.4893v1","created_at":"2026-05-18T03:55:11.382455+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1205.4893","created_at":"2026-05-18T03:55:11.382455+00:00"},{"alias_kind":"pith_short_12","alias_value":"ERGQFTCALK7Q","created_at":"2026-05-18T12:27:04.183437+00:00"},{"alias_kind":"pith_short_16","alias_value":"ERGQFTCALK7QIKE5","created_at":"2026-05-18T12:27:04.183437+00:00"},{"alias_kind":"pith_short_8","alias_value":"ERGQFTCA","created_at":"2026-05-18T12:27:04.183437+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/ERGQFTCALK7QIKE5IJKULQEPS5","json":"https://pith.science/pith/ERGQFTCALK7QIKE5IJKULQEPS5.json","graph_json":"https://pith.science/api/pith-number/ERGQFTCALK7QIKE5IJKULQEPS5/graph.json","events_json":"https://pith.science/api/pith-number/ERGQFTCALK7QIKE5IJKULQEPS5/events.json","paper":"https://pith.science/paper/ERGQFTCA"},"agent_actions":{"view_html":"https://pith.science/pith/ERGQFTCALK7QIKE5IJKULQEPS5","download_json":"https://pith.science/pith/ERGQFTCALK7QIKE5IJKULQEPS5.json","view_paper":"https://pith.science/paper/ERGQFTCA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1205.4893&json=true","fetch_graph":"https://pith.science/api/pith-number/ERGQFTCALK7QIKE5IJKULQEPS5/graph.json","fetch_events":"https://pith.science/api/pith-number/ERGQFTCALK7QIKE5IJKULQEPS5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ERGQFTCALK7QIKE5IJKULQEPS5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ERGQFTCALK7QIKE5IJKULQEPS5/action/storage_attestation","attest_author":"https://pith.science/pith/ERGQFTCALK7QIKE5IJKULQEPS5/action/author_attestation","sign_citation":"https://pith.science/pith/ERGQFTCALK7QIKE5IJKULQEPS5/action/citation_signature","submit_replication":"https://pith.science/pith/ERGQFTCALK7QIKE5IJKULQEPS5/action/replication_record"}},"created_at":"2026-05-18T03:55:11.382455+00:00","updated_at":"2026-05-18T03:55:11.382455+00:00"}