{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2003:EKZNSG2HDEEWZMCISHHD24JBMB","short_pith_number":"pith:EKZNSG2H","canonical_record":{"source":{"id":"math/0306047","kind":"arxiv","version":2},"metadata":{"license":"","primary_cat":"math.CO","submitted_at":"2003-06-02T21:03:14Z","cross_cats_sorted":["math.PR"],"title_canon_sha256":"cc5d6fcbfb488a48a6a37a9aed7cd0edad8fd9cca4e8a90f95dac16bc86a102c","abstract_canon_sha256":"085415a75a19071724d33034511756af29abedace4940d1ae008f67b3b348edc"},"schema_version":"1.0"},"canonical_sha256":"22b2d91b4719096cb04891ce3d71216055899d9762c76281df3efa3a6e99338b","source":{"kind":"arxiv","id":"math/0306047","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"math/0306047","created_at":"2026-05-18T01:05:28Z"},{"alias_kind":"arxiv_version","alias_value":"math/0306047v2","created_at":"2026-05-18T01:05:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.math/0306047","created_at":"2026-05-18T01:05:28Z"},{"alias_kind":"pith_short_12","alias_value":"EKZNSG2HDEEW","created_at":"2026-05-18T12:25:51Z"},{"alias_kind":"pith_short_16","alias_value":"EKZNSG2HDEEWZMCI","created_at":"2026-05-18T12:25:51Z"},{"alias_kind":"pith_short_8","alias_value":"EKZNSG2H","created_at":"2026-05-18T12:25:51Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2003:EKZNSG2HDEEWZMCISHHD24JBMB","target":"record","payload":{"canonical_record":{"source":{"id":"math/0306047","kind":"arxiv","version":2},"metadata":{"license":"","primary_cat":"math.CO","submitted_at":"2003-06-02T21:03:14Z","cross_cats_sorted":["math.PR"],"title_canon_sha256":"cc5d6fcbfb488a48a6a37a9aed7cd0edad8fd9cca4e8a90f95dac16bc86a102c","abstract_canon_sha256":"085415a75a19071724d33034511756af29abedace4940d1ae008f67b3b348edc"},"schema_version":"1.0"},"canonical_sha256":"22b2d91b4719096cb04891ce3d71216055899d9762c76281df3efa3a6e99338b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:05:28.829560Z","signature_b64":"1mRO4Dme8Od31xYXDwy3uNnql3VclhJ5MS2BLQBim02u2rdWRke+6dxKCFsBx7/iZIjPguF9y/qIKTKM8Hp7AQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"22b2d91b4719096cb04891ce3d71216055899d9762c76281df3efa3a6e99338b","last_reissued_at":"2026-05-18T01:05:28.829050Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:05:28.829050Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"math/0306047","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:05:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KckgLco2VO+eALk7Y5fxI6wzScu444Ziw/QnsoECqgB9auQG+O363oQhu8jZerZKEPFyPNlxnmU50lS2a41oCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T12:55:22.513918Z"},"content_sha256":"f84b9c9bf7c966ff6dd16b9e81194c6a6ae48cb197a056f9087fd32fcf04b2dd","schema_version":"1.0","event_id":"sha256:f84b9c9bf7c966ff6dd16b9e81194c6a6ae48cb197a056f9087fd32fcf04b2dd"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2003:EKZNSG2HDEEWZMCISHHD24JBMB","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Random MAX SAT, Random MAX CUT, and Their Phase Transitions","license":"","headline":"","cross_cats":["math.PR"],"primary_cat":"math.CO","authors_text":"David Gamarnik, Don Coppersmith, Gregory B. Sorkin, Mohammad Hajiaghayi","submitted_at":"2003-06-02T21:03:14Z","abstract_excerpt":"Given a 2-SAT formula $F$ consisting of $n$ variables and $\\cn$ random clauses, what is the largest number of clauses $\\max F$ satisfiable by a single assignment of the variables? We bound the answer away from the trivial bounds of $(3/4)cn$ and $cn$. We prove that for $c<1$, the expected number of clauses satisfiable is $\\cn-\\Theta(1/n)$; for large $c$, it is $((3/4)c + \\Theta(\\sqrt{c}))n$; for $c = 1+\\eps$, it is at least $(1+\\eps-O(\\eps^3))n$ and at most $(1+\\eps-\\Omega(\\eps^3/\\ln \\eps))n$; and in the ``scaling window'' $c= 1+\\Theta(n^{-1/3})$, it is $cn-\\Theta(1)$. In particular, just as t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"math/0306047","kind":"arxiv","version":2},"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:05:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iEuNZUbo7ETs5YF4aEQ28gMx1oj/P2KzBdmf5k/b2uiqF28Th+/m4sh2NippWRJ0GMvaUX4C7jfzz///M6a7Ag==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T12:55:22.514253Z"},"content_sha256":"ec64d54889ed558285052b04d10ccde2bb0e17b0ec3acae09a48af7587846475","schema_version":"1.0","event_id":"sha256:ec64d54889ed558285052b04d10ccde2bb0e17b0ec3acae09a48af7587846475"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/EKZNSG2HDEEWZMCISHHD24JBMB/bundle.json","state_url":"https://pith.science/pith/EKZNSG2HDEEWZMCISHHD24JBMB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/EKZNSG2HDEEWZMCISHHD24JBMB/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-23T12:55:22Z","links":{"resolver":"https://pith.science/pith/EKZNSG2HDEEWZMCISHHD24JBMB","bundle":"https://pith.science/pith/EKZNSG2HDEEWZMCISHHD24JBMB/bundle.json","state":"https://pith.science/pith/EKZNSG2HDEEWZMCISHHD24JBMB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/EKZNSG2HDEEWZMCISHHD24JBMB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2003:EKZNSG2HDEEWZMCISHHD24JBMB","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":"085415a75a19071724d33034511756af29abedace4940d1ae008f67b3b348edc","cross_cats_sorted":["math.PR"],"license":"","primary_cat":"math.CO","submitted_at":"2003-06-02T21:03:14Z","title_canon_sha256":"cc5d6fcbfb488a48a6a37a9aed7cd0edad8fd9cca4e8a90f95dac16bc86a102c"},"schema_version":"1.0","source":{"id":"math/0306047","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"math/0306047","created_at":"2026-05-18T01:05:28Z"},{"alias_kind":"arxiv_version","alias_value":"math/0306047v2","created_at":"2026-05-18T01:05:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.math/0306047","created_at":"2026-05-18T01:05:28Z"},{"alias_kind":"pith_short_12","alias_value":"EKZNSG2HDEEW","created_at":"2026-05-18T12:25:51Z"},{"alias_kind":"pith_short_16","alias_value":"EKZNSG2HDEEWZMCI","created_at":"2026-05-18T12:25:51Z"},{"alias_kind":"pith_short_8","alias_value":"EKZNSG2H","created_at":"2026-05-18T12:25:51Z"}],"graph_snapshots":[{"event_id":"sha256:ec64d54889ed558285052b04d10ccde2bb0e17b0ec3acae09a48af7587846475","target":"graph","created_at":"2026-05-18T01:05:28Z","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":"Given a 2-SAT formula $F$ consisting of $n$ variables and $\\cn$ random clauses, what is the largest number of clauses $\\max F$ satisfiable by a single assignment of the variables? We bound the answer away from the trivial bounds of $(3/4)cn$ and $cn$. We prove that for $c<1$, the expected number of clauses satisfiable is $\\cn-\\Theta(1/n)$; for large $c$, it is $((3/4)c + \\Theta(\\sqrt{c}))n$; for $c = 1+\\eps$, it is at least $(1+\\eps-O(\\eps^3))n$ and at most $(1+\\eps-\\Omega(\\eps^3/\\ln \\eps))n$; and in the ``scaling window'' $c= 1+\\Theta(n^{-1/3})$, it is $cn-\\Theta(1)$. In particular, just as t","authors_text":"David Gamarnik, Don Coppersmith, Gregory B. Sorkin, Mohammad Hajiaghayi","cross_cats":["math.PR"],"headline":"","license":"","primary_cat":"math.CO","submitted_at":"2003-06-02T21:03:14Z","title":"Random MAX SAT, Random MAX CUT, and Their Phase Transitions"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"math/0306047","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:f84b9c9bf7c966ff6dd16b9e81194c6a6ae48cb197a056f9087fd32fcf04b2dd","target":"record","created_at":"2026-05-18T01:05:28Z","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":"085415a75a19071724d33034511756af29abedace4940d1ae008f67b3b348edc","cross_cats_sorted":["math.PR"],"license":"","primary_cat":"math.CO","submitted_at":"2003-06-02T21:03:14Z","title_canon_sha256":"cc5d6fcbfb488a48a6a37a9aed7cd0edad8fd9cca4e8a90f95dac16bc86a102c"},"schema_version":"1.0","source":{"id":"math/0306047","kind":"arxiv","version":2}},"canonical_sha256":"22b2d91b4719096cb04891ce3d71216055899d9762c76281df3efa3a6e99338b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"22b2d91b4719096cb04891ce3d71216055899d9762c76281df3efa3a6e99338b","first_computed_at":"2026-05-18T01:05:28.829050Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:05:28.829050Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"1mRO4Dme8Od31xYXDwy3uNnql3VclhJ5MS2BLQBim02u2rdWRke+6dxKCFsBx7/iZIjPguF9y/qIKTKM8Hp7AQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:05:28.829560Z","signed_message":"canonical_sha256_bytes"},"source_id":"math/0306047","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f84b9c9bf7c966ff6dd16b9e81194c6a6ae48cb197a056f9087fd32fcf04b2dd","sha256:ec64d54889ed558285052b04d10ccde2bb0e17b0ec3acae09a48af7587846475"],"state_sha256":"944962fd6f8174bb410c947add10fc9202cd14e5caa1ba1c00ef92bf34da2959"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bdEBTFK/HhMkkoV0gH1eHpwBwTNumVS9h081mq9+rjuJz+kD3WJ6/5sCnQYPA2CJ2jpvWG/0b+ynP8st/ZzHCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-23T12:55:22.516100Z","bundle_sha256":"f354ff4ae46c507d29059813f683071268936418a981df78b1850e242c3b1fb0"}}