{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:M3RLFQ355WENT2CNJDSJ3YOO4F","short_pith_number":"pith:M3RLFQ35","schema_version":"1.0","canonical_sha256":"66e2b2c37ded88d9e84d48e49de1cee14c5341b2786ff84afecc6ac99f750177","source":{"kind":"arxiv","id":"1204.5074","version":1},"attestation_state":"computed","paper":{"title":"Adversary Lower Bound for Element Distinctness","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"quant-ph","authors_text":"Aleksandrs Belovs","submitted_at":"2012-04-23T14:18:18Z","abstract_excerpt":"In this note we construct an explicit optimal (negative-weight) adversary matrix for the element distinctness problem, given that the size of the alphabet is sufficiently large."},"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":"1204.5074","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2012-04-23T14:18:18Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"2781b29ccb80cf7dc7cab59e6dbb39c8a8113fbc38316b5345d9eafdb9cecc6e","abstract_canon_sha256":"dfc746e135141d024932a301182a2b5887615899a915ff5b69088944f97de2f3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:57:14.818480Z","signature_b64":"8qslw5SXPN4KUmfddCsvLqByCVzoen1EfzPOWptKEy1zGbyESTq95s84GiqOZzIOlE7oPUEwvEzJNYZTQTpkAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"66e2b2c37ded88d9e84d48e49de1cee14c5341b2786ff84afecc6ac99f750177","last_reissued_at":"2026-05-18T03:57:14.817991Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:57:14.817991Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Adversary Lower Bound for Element Distinctness","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"quant-ph","authors_text":"Aleksandrs Belovs","submitted_at":"2012-04-23T14:18:18Z","abstract_excerpt":"In this note we construct an explicit optimal (negative-weight) adversary matrix for the element distinctness problem, given that the size of the alphabet is sufficiently large."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1204.5074","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":"1204.5074","created_at":"2026-05-18T03:57:14.818074+00:00"},{"alias_kind":"arxiv_version","alias_value":"1204.5074v1","created_at":"2026-05-18T03:57:14.818074+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1204.5074","created_at":"2026-05-18T03:57:14.818074+00:00"},{"alias_kind":"pith_short_12","alias_value":"M3RLFQ355WEN","created_at":"2026-05-18T12:27:14.488303+00:00"},{"alias_kind":"pith_short_16","alias_value":"M3RLFQ355WENT2CN","created_at":"2026-05-18T12:27:14.488303+00:00"},{"alias_kind":"pith_short_8","alias_value":"M3RLFQ35","created_at":"2026-05-18T12:27:14.488303+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/M3RLFQ355WENT2CNJDSJ3YOO4F","json":"https://pith.science/pith/M3RLFQ355WENT2CNJDSJ3YOO4F.json","graph_json":"https://pith.science/api/pith-number/M3RLFQ355WENT2CNJDSJ3YOO4F/graph.json","events_json":"https://pith.science/api/pith-number/M3RLFQ355WENT2CNJDSJ3YOO4F/events.json","paper":"https://pith.science/paper/M3RLFQ35"},"agent_actions":{"view_html":"https://pith.science/pith/M3RLFQ355WENT2CNJDSJ3YOO4F","download_json":"https://pith.science/pith/M3RLFQ355WENT2CNJDSJ3YOO4F.json","view_paper":"https://pith.science/paper/M3RLFQ35","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1204.5074&json=true","fetch_graph":"https://pith.science/api/pith-number/M3RLFQ355WENT2CNJDSJ3YOO4F/graph.json","fetch_events":"https://pith.science/api/pith-number/M3RLFQ355WENT2CNJDSJ3YOO4F/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/M3RLFQ355WENT2CNJDSJ3YOO4F/action/timestamp_anchor","attest_storage":"https://pith.science/pith/M3RLFQ355WENT2CNJDSJ3YOO4F/action/storage_attestation","attest_author":"https://pith.science/pith/M3RLFQ355WENT2CNJDSJ3YOO4F/action/author_attestation","sign_citation":"https://pith.science/pith/M3RLFQ355WENT2CNJDSJ3YOO4F/action/citation_signature","submit_replication":"https://pith.science/pith/M3RLFQ355WENT2CNJDSJ3YOO4F/action/replication_record"}},"created_at":"2026-05-18T03:57:14.818074+00:00","updated_at":"2026-05-18T03:57:14.818074+00:00"}