{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:NBBNVSMCILBTJPH4J46DU4FBUG","short_pith_number":"pith:NBBNVSMC","canonical_record":{"source":{"id":"2411.03813","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2024-11-06T10:26:26Z","cross_cats_sorted":["cs.CC","cs.DM"],"title_canon_sha256":"e7c78c406315f702bfc56b7873ffed00785f7e0a301167ae4bae55a480577d19","abstract_canon_sha256":"76d60373c252e93f3e6f2c67528d55c8bec602c91adf0188aebe602c2b0b602d"},"schema_version":"1.0"},"canonical_sha256":"6842dac98242c334bcfc4f3c3a70a1a19515ac06fb08e019a8faced74c55ebbc","source":{"kind":"arxiv","id":"2411.03813","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2411.03813","created_at":"2026-07-05T09:31:56Z"},{"alias_kind":"arxiv_version","alias_value":"2411.03813v1","created_at":"2026-07-05T09:31:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2411.03813","created_at":"2026-07-05T09:31:56Z"},{"alias_kind":"pith_short_12","alias_value":"NBBNVSMCILBT","created_at":"2026-07-05T09:31:56Z"},{"alias_kind":"pith_short_16","alias_value":"NBBNVSMCILBTJPH4","created_at":"2026-07-05T09:31:56Z"},{"alias_kind":"pith_short_8","alias_value":"NBBNVSMC","created_at":"2026-07-05T09:31:56Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:NBBNVSMCILBTJPH4J46DU4FBUG","target":"record","payload":{"canonical_record":{"source":{"id":"2411.03813","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2024-11-06T10:26:26Z","cross_cats_sorted":["cs.CC","cs.DM"],"title_canon_sha256":"e7c78c406315f702bfc56b7873ffed00785f7e0a301167ae4bae55a480577d19","abstract_canon_sha256":"76d60373c252e93f3e6f2c67528d55c8bec602c91adf0188aebe602c2b0b602d"},"schema_version":"1.0"},"canonical_sha256":"6842dac98242c334bcfc4f3c3a70a1a19515ac06fb08e019a8faced74c55ebbc","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:31:56.402778Z","signature_b64":"IYn+0eFXdk8Vv8FjG2L14ItuUUJ0x9Hl/b4Yqsss3QSt44JK4iq/fr50surzPt8sScMrCCWZV0T92SUQkLYZAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6842dac98242c334bcfc4f3c3a70a1a19515ac06fb08e019a8faced74c55ebbc","last_reissued_at":"2026-07-05T09:31:56.402277Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:31:56.402277Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2411.03813","source_version":1,"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-07-05T09:31:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Ecyg0EXxSu3U8EiU4bXSor50C5c5yw35GEuQvKlNUXuxcmMyAX5Wnheh75hNoaNE+zEMJumakXCCMVHMGHr3CA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-17T05:16:30.394395Z"},"content_sha256":"aa7da3264c37565131a367c2c01509cef274caa35c076587fdff590cc3e8c40e","schema_version":"1.0","event_id":"sha256:aa7da3264c37565131a367c2c01509cef274caa35c076587fdff590cc3e8c40e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:NBBNVSMCILBTJPH4J46DU4FBUG","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the satisfiability of random $3$-SAT formulas with $k$-wise independent clauses","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.DM"],"primary_cat":"math.CO","authors_text":"Ioannis Caragiannis, Nick Gravin, Zhile Jiang","submitted_at":"2024-11-06T10:26:26Z","abstract_excerpt":"The problem of identifying the satisfiability threshold of random $3$-SAT formulas has received a lot of attention during the last decades and has inspired the study of other threshold phenomena in random combinatorial structures. The classical assumption in this line of research is that, for a given set of $n$ Boolean variables, each clause is drawn uniformly at random among all sets of three literals from these variables, independently from other clauses. Here, we keep the uniform distribution of each clause, but deviate significantly from the independence assumption and consider richer fami"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2411.03813","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2411.03813/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T09:31:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7iPETM8JOirCvHVO/1GINXIiWZiRdpEavcex9z3sr86m8fljHwwEjnWBgfyn2aYNvjCezrDWsdJoaSQbs+mxCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-17T05:16:30.394793Z"},"content_sha256":"7dec17a8d539b36646e5b1e2b5fbfd3004e72413a6c1100cdec1127927ab1065","schema_version":"1.0","event_id":"sha256:7dec17a8d539b36646e5b1e2b5fbfd3004e72413a6c1100cdec1127927ab1065"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NBBNVSMCILBTJPH4J46DU4FBUG/bundle.json","state_url":"https://pith.science/pith/NBBNVSMCILBTJPH4J46DU4FBUG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NBBNVSMCILBTJPH4J46DU4FBUG/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-07-17T05:16:30Z","links":{"resolver":"https://pith.science/pith/NBBNVSMCILBTJPH4J46DU4FBUG","bundle":"https://pith.science/pith/NBBNVSMCILBTJPH4J46DU4FBUG/bundle.json","state":"https://pith.science/pith/NBBNVSMCILBTJPH4J46DU4FBUG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NBBNVSMCILBTJPH4J46DU4FBUG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:NBBNVSMCILBTJPH4J46DU4FBUG","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":"76d60373c252e93f3e6f2c67528d55c8bec602c91adf0188aebe602c2b0b602d","cross_cats_sorted":["cs.CC","cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2024-11-06T10:26:26Z","title_canon_sha256":"e7c78c406315f702bfc56b7873ffed00785f7e0a301167ae4bae55a480577d19"},"schema_version":"1.0","source":{"id":"2411.03813","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2411.03813","created_at":"2026-07-05T09:31:56Z"},{"alias_kind":"arxiv_version","alias_value":"2411.03813v1","created_at":"2026-07-05T09:31:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2411.03813","created_at":"2026-07-05T09:31:56Z"},{"alias_kind":"pith_short_12","alias_value":"NBBNVSMCILBT","created_at":"2026-07-05T09:31:56Z"},{"alias_kind":"pith_short_16","alias_value":"NBBNVSMCILBTJPH4","created_at":"2026-07-05T09:31:56Z"},{"alias_kind":"pith_short_8","alias_value":"NBBNVSMC","created_at":"2026-07-05T09:31:56Z"}],"graph_snapshots":[{"event_id":"sha256:7dec17a8d539b36646e5b1e2b5fbfd3004e72413a6c1100cdec1127927ab1065","target":"graph","created_at":"2026-07-05T09:31:56Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2411.03813/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"The problem of identifying the satisfiability threshold of random $3$-SAT formulas has received a lot of attention during the last decades and has inspired the study of other threshold phenomena in random combinatorial structures. The classical assumption in this line of research is that, for a given set of $n$ Boolean variables, each clause is drawn uniformly at random among all sets of three literals from these variables, independently from other clauses. Here, we keep the uniform distribution of each clause, but deviate significantly from the independence assumption and consider richer fami","authors_text":"Ioannis Caragiannis, Nick Gravin, Zhile Jiang","cross_cats":["cs.CC","cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2024-11-06T10:26:26Z","title":"On the satisfiability of random $3$-SAT formulas with $k$-wise independent clauses"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2411.03813","kind":"arxiv","version":1},"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:aa7da3264c37565131a367c2c01509cef274caa35c076587fdff590cc3e8c40e","target":"record","created_at":"2026-07-05T09:31:56Z","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":"76d60373c252e93f3e6f2c67528d55c8bec602c91adf0188aebe602c2b0b602d","cross_cats_sorted":["cs.CC","cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2024-11-06T10:26:26Z","title_canon_sha256":"e7c78c406315f702bfc56b7873ffed00785f7e0a301167ae4bae55a480577d19"},"schema_version":"1.0","source":{"id":"2411.03813","kind":"arxiv","version":1}},"canonical_sha256":"6842dac98242c334bcfc4f3c3a70a1a19515ac06fb08e019a8faced74c55ebbc","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6842dac98242c334bcfc4f3c3a70a1a19515ac06fb08e019a8faced74c55ebbc","first_computed_at":"2026-07-05T09:31:56.402277Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T09:31:56.402277Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"IYn+0eFXdk8Vv8FjG2L14ItuUUJ0x9Hl/b4Yqsss3QSt44JK4iq/fr50surzPt8sScMrCCWZV0T92SUQkLYZAA==","signature_status":"signed_v1","signed_at":"2026-07-05T09:31:56.402778Z","signed_message":"canonical_sha256_bytes"},"source_id":"2411.03813","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:aa7da3264c37565131a367c2c01509cef274caa35c076587fdff590cc3e8c40e","sha256:7dec17a8d539b36646e5b1e2b5fbfd3004e72413a6c1100cdec1127927ab1065"],"state_sha256":"f623b048de2113ea1171a6e5749a6853b75175dd8dc3594da5879af3db3047e0"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZOv1oGR7LAGTByLJCnfKYofZRjDsusQTkGbWFBbrQt32ZnhFG2dPtW+ZkKeYkPG2IC1W3rF9zOIJDmRCusM5AQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-17T05:16:30.397223Z","bundle_sha256":"186b95fba9292ce0758218bb8e86d066c6f70fd30a292fc2558caa2b3859b7ce"}}