{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:JKINL2I64VJQ43OTGUQEJBNDTJ","short_pith_number":"pith:JKINL2I6","schema_version":"1.0","canonical_sha256":"4a90d5e91ee5530e6dd335204485a39a61df6d4d38db75289bb4791896e2a9c4","source":{"kind":"arxiv","id":"1804.08662","version":1},"attestation_state":"computed","paper":{"title":"Small-Set Expansion in Shortcode Graph and the 2-to-2 Conjecture","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Boaz Barak, David Steurer, Pravesh K. Kothari","submitted_at":"2018-04-23T18:48:49Z","abstract_excerpt":"Dinur, Khot, Kindler, Minzer and Safra (2016) recently showed that the (imperfect completeness variant of) Khot's 2 to 2 games conjecture follows from a combinatorial hypothesis about the soundness of a certain \"Grassmanian agreement tester\". In this work, we show that the hypothesis of Dinur et. al. follows from a conjecture we call the \"Inverse Shortcode Hypothesis\" characterizing the non-expanding sets of the degree-two shortcode graph. We also show the latter conjecture is equivalent to a characterization of the non-expanding sets in the Grassman graph, as hypothesized by a follow-up paper"},"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":"1804.08662","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2018-04-23T18:48:49Z","cross_cats_sorted":[],"title_canon_sha256":"f450371757b3c2e804533771e03b38bf4c7d5b6f85894258fcb39e0584ea7a6e","abstract_canon_sha256":"ce4d726d857a5b49874fa6580debdd88b3ee7befcbd6c583cb5f8ac31bf76ff0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:17:47.078402Z","signature_b64":"MEnOmLIEo+nRbxFeWBHsY+H/3BIlfHwpDjV4A1g9+xBCFbTHkU9np8huFQ4bDf0c16q3/kv7jGgQZOO8IcS+CA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4a90d5e91ee5530e6dd335204485a39a61df6d4d38db75289bb4791896e2a9c4","last_reissued_at":"2026-05-18T00:17:47.077723Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:17:47.077723Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Small-Set Expansion in Shortcode Graph and the 2-to-2 Conjecture","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Boaz Barak, David Steurer, Pravesh K. Kothari","submitted_at":"2018-04-23T18:48:49Z","abstract_excerpt":"Dinur, Khot, Kindler, Minzer and Safra (2016) recently showed that the (imperfect completeness variant of) Khot's 2 to 2 games conjecture follows from a combinatorial hypothesis about the soundness of a certain \"Grassmanian agreement tester\". In this work, we show that the hypothesis of Dinur et. al. follows from a conjecture we call the \"Inverse Shortcode Hypothesis\" characterizing the non-expanding sets of the degree-two shortcode graph. We also show the latter conjecture is equivalent to a characterization of the non-expanding sets in the Grassman graph, as hypothesized by a follow-up paper"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.08662","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":"1804.08662","created_at":"2026-05-18T00:17:47.077815+00:00"},{"alias_kind":"arxiv_version","alias_value":"1804.08662v1","created_at":"2026-05-18T00:17:47.077815+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.08662","created_at":"2026-05-18T00:17:47.077815+00:00"},{"alias_kind":"pith_short_12","alias_value":"JKINL2I64VJQ","created_at":"2026-05-18T12:32:31.084164+00:00"},{"alias_kind":"pith_short_16","alias_value":"JKINL2I64VJQ43OT","created_at":"2026-05-18T12:32:31.084164+00:00"},{"alias_kind":"pith_short_8","alias_value":"JKINL2I6","created_at":"2026-05-18T12:32:31.084164+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/JKINL2I64VJQ43OTGUQEJBNDTJ","json":"https://pith.science/pith/JKINL2I64VJQ43OTGUQEJBNDTJ.json","graph_json":"https://pith.science/api/pith-number/JKINL2I64VJQ43OTGUQEJBNDTJ/graph.json","events_json":"https://pith.science/api/pith-number/JKINL2I64VJQ43OTGUQEJBNDTJ/events.json","paper":"https://pith.science/paper/JKINL2I6"},"agent_actions":{"view_html":"https://pith.science/pith/JKINL2I64VJQ43OTGUQEJBNDTJ","download_json":"https://pith.science/pith/JKINL2I64VJQ43OTGUQEJBNDTJ.json","view_paper":"https://pith.science/paper/JKINL2I6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1804.08662&json=true","fetch_graph":"https://pith.science/api/pith-number/JKINL2I64VJQ43OTGUQEJBNDTJ/graph.json","fetch_events":"https://pith.science/api/pith-number/JKINL2I64VJQ43OTGUQEJBNDTJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JKINL2I64VJQ43OTGUQEJBNDTJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JKINL2I64VJQ43OTGUQEJBNDTJ/action/storage_attestation","attest_author":"https://pith.science/pith/JKINL2I64VJQ43OTGUQEJBNDTJ/action/author_attestation","sign_citation":"https://pith.science/pith/JKINL2I64VJQ43OTGUQEJBNDTJ/action/citation_signature","submit_replication":"https://pith.science/pith/JKINL2I64VJQ43OTGUQEJBNDTJ/action/replication_record"}},"created_at":"2026-05-18T00:17:47.077815+00:00","updated_at":"2026-05-18T00:17:47.077815+00:00"}