{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2007:JWM4CU7EL3Y2R25WUK2A6PD5B2","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":"8555f50b8c491f6e70ff6732479696cfbc088d7bc0cbaf6da6fe15a11ebee919","cross_cats_sorted":[],"license":"","primary_cat":"math.CO","submitted_at":"2007-07-29T00:47:53Z","title_canon_sha256":"ddc4983f71287bd34c9a9d7ef451816ac4e070c427179e436546076946b57d21"},"schema_version":"1.0","source":{"id":"0707.4269","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0707.4269","created_at":"2026-05-18T04:09:15Z"},{"alias_kind":"arxiv_version","alias_value":"0707.4269v2","created_at":"2026-05-18T04:09:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0707.4269","created_at":"2026-05-18T04:09:15Z"},{"alias_kind":"pith_short_12","alias_value":"JWM4CU7EL3Y2","created_at":"2026-05-18T12:25:55Z"},{"alias_kind":"pith_short_16","alias_value":"JWM4CU7EL3Y2R25W","created_at":"2026-05-18T12:25:55Z"},{"alias_kind":"pith_short_8","alias_value":"JWM4CU7E","created_at":"2026-05-18T12:25:55Z"}],"graph_snapshots":[{"event_id":"sha256:e914508327fa7acd4e8ba39ef47ac14e85164c48e586e2d9d2b9588fd8a35863","target":"graph","created_at":"2026-05-18T04:09:15Z","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":"Combinatorics, like computer science, often has to deal with large objects of unspecified (or unusable) structure. One powerful way to deal with such an arbitrary object is to decompose it into more usable components. In particular, it has proven profitable to decompose such objects into a \\emph{structured} component, a \\emph{pseudo-random} component, and a \\emph{small} component (i.e. an error term); in many cases it is the structured component which then dominates. We illustrate this philosophy in a number of model cases.","authors_text":"Terence Tao","cross_cats":[],"headline":"","license":"","primary_cat":"math.CO","submitted_at":"2007-07-29T00:47:53Z","title":"Structure and randomness in combinatorics"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0707.4269","kind":"arxiv","version":2},"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:3b9865b86d03822b03e9de2e99735c77ccd0908166f587e3801ec7f0af5b3c44","target":"record","created_at":"2026-05-18T04:09:15Z","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":"8555f50b8c491f6e70ff6732479696cfbc088d7bc0cbaf6da6fe15a11ebee919","cross_cats_sorted":[],"license":"","primary_cat":"math.CO","submitted_at":"2007-07-29T00:47:53Z","title_canon_sha256":"ddc4983f71287bd34c9a9d7ef451816ac4e070c427179e436546076946b57d21"},"schema_version":"1.0","source":{"id":"0707.4269","kind":"arxiv","version":2}},"canonical_sha256":"4d99c153e45ef1a8ebb6a2b40f3c7d0eb486cdf320508a6a4463c3f1773f336c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4d99c153e45ef1a8ebb6a2b40f3c7d0eb486cdf320508a6a4463c3f1773f336c","first_computed_at":"2026-05-18T04:09:15.361852Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:09:15.361852Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"3wJ7a8jO0tPGkR+8BOCJ8sbO4afb9vW9YBMfLyoNuMaGszIVejwZ9bG4N7sWNt3lYjR6KpQ0fOeka0NGj5xoBA==","signature_status":"signed_v1","signed_at":"2026-05-18T04:09:15.362497Z","signed_message":"canonical_sha256_bytes"},"source_id":"0707.4269","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3b9865b86d03822b03e9de2e99735c77ccd0908166f587e3801ec7f0af5b3c44","sha256:e914508327fa7acd4e8ba39ef47ac14e85164c48e586e2d9d2b9588fd8a35863"],"state_sha256":"0490980a42d19e8279a2ff3125fddaa377534464430f09045e5c540fa4b80f7f"}