{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:CM2I6DDEABKRA24AWIU65IJPCP","short_pith_number":"pith:CM2I6DDE","canonical_record":{"source":{"id":"1903.10618","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2019-03-25T22:19:46Z","cross_cats_sorted":[],"title_canon_sha256":"295bb95c775725a61e1626239892212253560d98792941fbccc0d9e06499fd38","abstract_canon_sha256":"587f999bdfb388360df321f55bff31caae76bad341a02dbfdf0436d9a9827fb0"},"schema_version":"1.0"},"canonical_sha256":"13348f0c640055106b80b229eea12f13c1294e1e037fd0c852e29e8617b3142b","source":{"kind":"arxiv","id":"1903.10618","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1903.10618","created_at":"2026-05-17T23:50:18Z"},{"alias_kind":"arxiv_version","alias_value":"1903.10618v1","created_at":"2026-05-17T23:50:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.10618","created_at":"2026-05-17T23:50:18Z"},{"alias_kind":"pith_short_12","alias_value":"CM2I6DDEABKR","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_16","alias_value":"CM2I6DDEABKRA24A","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_8","alias_value":"CM2I6DDE","created_at":"2026-05-18T12:33:15Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:CM2I6DDEABKRA24AWIU65IJPCP","target":"record","payload":{"canonical_record":{"source":{"id":"1903.10618","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2019-03-25T22:19:46Z","cross_cats_sorted":[],"title_canon_sha256":"295bb95c775725a61e1626239892212253560d98792941fbccc0d9e06499fd38","abstract_canon_sha256":"587f999bdfb388360df321f55bff31caae76bad341a02dbfdf0436d9a9827fb0"},"schema_version":"1.0"},"canonical_sha256":"13348f0c640055106b80b229eea12f13c1294e1e037fd0c852e29e8617b3142b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:50:18.328860Z","signature_b64":"TfIlGgL4I4Mp2iVOjcJExRWLjoTWpZ1+GF6ud57W60lu4Yrw9VZBdTaP4rXpovnuPGvKOnLtLKHhiikWgnGJDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"13348f0c640055106b80b229eea12f13c1294e1e037fd0c852e29e8617b3142b","last_reissued_at":"2026-05-17T23:50:18.328041Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:50:18.328041Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1903.10618","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-05-17T23:50:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1NYQwk1mSoTFAmNUF7R/ZdMWyuKh6gyLm7hOZ2jVbx9Z3VBBCqPb8bTN91VOKCllRL4lZd7Rj8nEBUWzz13qBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T20:00:26.810633Z"},"content_sha256":"dd6bbf5d15b077afccd74683a5cc9087bff74ac97f2b4f06d07b8341731e32d4","schema_version":"1.0","event_id":"sha256:dd6bbf5d15b077afccd74683a5cc9087bff74ac97f2b4f06d07b8341731e32d4"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:CM2I6DDEABKRA24AWIU65IJPCP","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Faster Random $k$-CNF Satisfiability","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Adam Yedidia, Andrea Lincoln","submitted_at":"2019-03-25T22:19:46Z","abstract_excerpt":"We describe an algorithm to solve the problem of Boolean CNF-Satisfiability when the input formula is chosen randomly.\n  We build upon the algorithms of Sch{\\\"{o}}ning 1999 and Dantsin et al.~in 2002. The Sch{\\\"{o}}ning algorithm works by trying many possible random assignments, and for each one searching systematically in the neighborhood of that assignment for a satisfying solution. Previous algorithms for this problem run in time $O(2^{n (1- \\Omega(1)/k)})$.\n  Our improvement is simple: we count how many clauses are satisfied by each randomly sampled assignment, and only search in the neigh"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.10618","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"},"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-17T23:50:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7AZrWfSgyXUxfRQu8NsjJ4K/p3E655GkHjNtwnmE7dVx3Khn9LviYuym5TP64Knenp2/UjefFl0Pdo+E1aY/Ag==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T20:00:26.810977Z"},"content_sha256":"bd654da8e6f4344f1f29ed60a1d93526fdb066bd77c3d8e001b7894400590a76","schema_version":"1.0","event_id":"sha256:bd654da8e6f4344f1f29ed60a1d93526fdb066bd77c3d8e001b7894400590a76"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CM2I6DDEABKRA24AWIU65IJPCP/bundle.json","state_url":"https://pith.science/pith/CM2I6DDEABKRA24AWIU65IJPCP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CM2I6DDEABKRA24AWIU65IJPCP/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-25T20:00:26Z","links":{"resolver":"https://pith.science/pith/CM2I6DDEABKRA24AWIU65IJPCP","bundle":"https://pith.science/pith/CM2I6DDEABKRA24AWIU65IJPCP/bundle.json","state":"https://pith.science/pith/CM2I6DDEABKRA24AWIU65IJPCP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CM2I6DDEABKRA24AWIU65IJPCP/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:CM2I6DDEABKRA24AWIU65IJPCP","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":"587f999bdfb388360df321f55bff31caae76bad341a02dbfdf0436d9a9827fb0","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2019-03-25T22:19:46Z","title_canon_sha256":"295bb95c775725a61e1626239892212253560d98792941fbccc0d9e06499fd38"},"schema_version":"1.0","source":{"id":"1903.10618","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1903.10618","created_at":"2026-05-17T23:50:18Z"},{"alias_kind":"arxiv_version","alias_value":"1903.10618v1","created_at":"2026-05-17T23:50:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.10618","created_at":"2026-05-17T23:50:18Z"},{"alias_kind":"pith_short_12","alias_value":"CM2I6DDEABKR","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_16","alias_value":"CM2I6DDEABKRA24A","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_8","alias_value":"CM2I6DDE","created_at":"2026-05-18T12:33:15Z"}],"graph_snapshots":[{"event_id":"sha256:bd654da8e6f4344f1f29ed60a1d93526fdb066bd77c3d8e001b7894400590a76","target":"graph","created_at":"2026-05-17T23:50:18Z","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":"We describe an algorithm to solve the problem of Boolean CNF-Satisfiability when the input formula is chosen randomly.\n  We build upon the algorithms of Sch{\\\"{o}}ning 1999 and Dantsin et al.~in 2002. The Sch{\\\"{o}}ning algorithm works by trying many possible random assignments, and for each one searching systematically in the neighborhood of that assignment for a satisfying solution. Previous algorithms for this problem run in time $O(2^{n (1- \\Omega(1)/k)})$.\n  Our improvement is simple: we count how many clauses are satisfied by each randomly sampled assignment, and only search in the neigh","authors_text":"Adam Yedidia, Andrea Lincoln","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2019-03-25T22:19:46Z","title":"Faster Random $k$-CNF Satisfiability"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.10618","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:dd6bbf5d15b077afccd74683a5cc9087bff74ac97f2b4f06d07b8341731e32d4","target":"record","created_at":"2026-05-17T23:50:18Z","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":"587f999bdfb388360df321f55bff31caae76bad341a02dbfdf0436d9a9827fb0","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2019-03-25T22:19:46Z","title_canon_sha256":"295bb95c775725a61e1626239892212253560d98792941fbccc0d9e06499fd38"},"schema_version":"1.0","source":{"id":"1903.10618","kind":"arxiv","version":1}},"canonical_sha256":"13348f0c640055106b80b229eea12f13c1294e1e037fd0c852e29e8617b3142b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"13348f0c640055106b80b229eea12f13c1294e1e037fd0c852e29e8617b3142b","first_computed_at":"2026-05-17T23:50:18.328041Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:50:18.328041Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"TfIlGgL4I4Mp2iVOjcJExRWLjoTWpZ1+GF6ud57W60lu4Yrw9VZBdTaP4rXpovnuPGvKOnLtLKHhiikWgnGJDA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:50:18.328860Z","signed_message":"canonical_sha256_bytes"},"source_id":"1903.10618","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:dd6bbf5d15b077afccd74683a5cc9087bff74ac97f2b4f06d07b8341731e32d4","sha256:bd654da8e6f4344f1f29ed60a1d93526fdb066bd77c3d8e001b7894400590a76"],"state_sha256":"49024237c08ece6c1149511d8a57042803703a5a2cc0c7fd1b19b79a61dc56e9"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lJjy/cpptv8MIxGyZvT3ZHpy8244MeuA+RxkBnnwtbv5M0x7+vozAU5yI2OSRqTIzSaOnFoerYNw8Mebv1W+DQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-25T20:00:26.812919Z","bundle_sha256":"9337a10f369819ed988ada356468f15561c78402389e2c525eecbce1b4392994"}}