{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:OPQAQ5AMOYZCZHHAJ6TR7L5UCI","short_pith_number":"pith:OPQAQ5AM","schema_version":"1.0","canonical_sha256":"73e008740c76322c9ce04fa71fafb4123efa7d48caf1e8065f5861ecc7bb420a","source":{"kind":"arxiv","id":"1302.3507","version":1},"attestation_state":"computed","paper":{"title":"Discrepancy of random graphs and hypergraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Benny Sudakov, Humberto Naves, Jie Ma","submitted_at":"2013-02-14T18:56:40Z","abstract_excerpt":"Answering in a strong form a question posed by Bollob\\'as and Scott, in this paper we determine the discrepancy between two random k-uniform hypergraphs, up to a constant factor depending solely on k."},"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":"1302.3507","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-02-14T18:56:40Z","cross_cats_sorted":[],"title_canon_sha256":"4ce3e47efaeb1e3e822a84d13198a15f5e26fa4e8055f62d00343ae1fb6cd9bc","abstract_canon_sha256":"34b4693f96073949554d0cb458b0a00710ff679f3b12dd982722f95f502afc0c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:33:38.407892Z","signature_b64":"YCt3LqMJ9rCmpZFeYwPv3dmkmtS6yH/4GQBee+x717KP/y69PfHRUdYclZdZy4UCz8tTZvBUFWu+ofeM+ZwLAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"73e008740c76322c9ce04fa71fafb4123efa7d48caf1e8065f5861ecc7bb420a","last_reissued_at":"2026-05-18T03:33:38.407018Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:33:38.407018Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Discrepancy of random graphs and hypergraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Benny Sudakov, Humberto Naves, Jie Ma","submitted_at":"2013-02-14T18:56:40Z","abstract_excerpt":"Answering in a strong form a question posed by Bollob\\'as and Scott, in this paper we determine the discrepancy between two random k-uniform hypergraphs, up to a constant factor depending solely on k."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1302.3507","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":"1302.3507","created_at":"2026-05-18T03:33:38.407172+00:00"},{"alias_kind":"arxiv_version","alias_value":"1302.3507v1","created_at":"2026-05-18T03:33:38.407172+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1302.3507","created_at":"2026-05-18T03:33:38.407172+00:00"},{"alias_kind":"pith_short_12","alias_value":"OPQAQ5AMOYZC","created_at":"2026-05-18T12:27:54.935989+00:00"},{"alias_kind":"pith_short_16","alias_value":"OPQAQ5AMOYZCZHHA","created_at":"2026-05-18T12:27:54.935989+00:00"},{"alias_kind":"pith_short_8","alias_value":"OPQAQ5AM","created_at":"2026-05-18T12:27:54.935989+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/OPQAQ5AMOYZCZHHAJ6TR7L5UCI","json":"https://pith.science/pith/OPQAQ5AMOYZCZHHAJ6TR7L5UCI.json","graph_json":"https://pith.science/api/pith-number/OPQAQ5AMOYZCZHHAJ6TR7L5UCI/graph.json","events_json":"https://pith.science/api/pith-number/OPQAQ5AMOYZCZHHAJ6TR7L5UCI/events.json","paper":"https://pith.science/paper/OPQAQ5AM"},"agent_actions":{"view_html":"https://pith.science/pith/OPQAQ5AMOYZCZHHAJ6TR7L5UCI","download_json":"https://pith.science/pith/OPQAQ5AMOYZCZHHAJ6TR7L5UCI.json","view_paper":"https://pith.science/paper/OPQAQ5AM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1302.3507&json=true","fetch_graph":"https://pith.science/api/pith-number/OPQAQ5AMOYZCZHHAJ6TR7L5UCI/graph.json","fetch_events":"https://pith.science/api/pith-number/OPQAQ5AMOYZCZHHAJ6TR7L5UCI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OPQAQ5AMOYZCZHHAJ6TR7L5UCI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OPQAQ5AMOYZCZHHAJ6TR7L5UCI/action/storage_attestation","attest_author":"https://pith.science/pith/OPQAQ5AMOYZCZHHAJ6TR7L5UCI/action/author_attestation","sign_citation":"https://pith.science/pith/OPQAQ5AMOYZCZHHAJ6TR7L5UCI/action/citation_signature","submit_replication":"https://pith.science/pith/OPQAQ5AMOYZCZHHAJ6TR7L5UCI/action/replication_record"}},"created_at":"2026-05-18T03:33:38.407172+00:00","updated_at":"2026-05-18T03:33:38.407172+00:00"}