{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:C47VLOBVVPGPLPD3RHLAHS2NHU","short_pith_number":"pith:C47VLOBV","canonical_record":{"source":{"id":"1706.08431","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DM","submitted_at":"2017-06-26T15:12:25Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"5c69d464d066e2ea97199dcf7b1b0ceae235615c9d908a757b8eb1745e67a667","abstract_canon_sha256":"734518514282e6896de1d2c45791cbf9b7dd0b26f9836dd189ab0339a1666244"},"schema_version":"1.0"},"canonical_sha256":"173f55b835abccf5bc7b89d603cb4d3d1584d0213333dc7b9d0735703c7c8ad7","source":{"kind":"arxiv","id":"1706.08431","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1706.08431","created_at":"2026-05-17T23:47:12Z"},{"alias_kind":"arxiv_version","alias_value":"1706.08431v1","created_at":"2026-05-17T23:47:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.08431","created_at":"2026-05-17T23:47:12Z"},{"alias_kind":"pith_short_12","alias_value":"C47VLOBVVPGP","created_at":"2026-05-18T12:31:08Z"},{"alias_kind":"pith_short_16","alias_value":"C47VLOBVVPGPLPD3","created_at":"2026-05-18T12:31:08Z"},{"alias_kind":"pith_short_8","alias_value":"C47VLOBV","created_at":"2026-05-18T12:31:08Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:C47VLOBVVPGPLPD3RHLAHS2NHU","target":"record","payload":{"canonical_record":{"source":{"id":"1706.08431","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DM","submitted_at":"2017-06-26T15:12:25Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"5c69d464d066e2ea97199dcf7b1b0ceae235615c9d908a757b8eb1745e67a667","abstract_canon_sha256":"734518514282e6896de1d2c45791cbf9b7dd0b26f9836dd189ab0339a1666244"},"schema_version":"1.0"},"canonical_sha256":"173f55b835abccf5bc7b89d603cb4d3d1584d0213333dc7b9d0735703c7c8ad7","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:47:12.853787Z","signature_b64":"j0JzcwTAYhZ+uUp0GZbU4ojFadDGTycEudd5Vec75zsqPu35gaAPzlepYi4XuBVTiDT2dhZ0rp47F0rIjgKXAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"173f55b835abccf5bc7b89d603cb4d3d1584d0213333dc7b9d0735703c7c8ad7","last_reissued_at":"2026-05-17T23:47:12.853381Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:47:12.853381Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1706.08431","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:47:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lVlVqYFn/yu9PmOAjosHj8lv2XbuBUT+A+zq30yc7F7kwf8u8bHMWBvWuCixcbVomzIivUmhxF2ezc+CzCrgBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T08:35:12.871077Z"},"content_sha256":"729811d01aad8b3932fc6326a63412d50f07189697f1c4296b1cf3a2ae122b66","schema_version":"1.0","event_id":"sha256:729811d01aad8b3932fc6326a63412d50f07189697f1c4296b1cf3a2ae122b66"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:C47VLOBVVPGPLPD3RHLAHS2NHU","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Bounds on the Satisfiability Threshold for Power Law Distributed Random SAT","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"cs.DM","authors_text":"Andrew M. Sutton, Anton Krohmer, Ralf Rothenberger, Thomas Sauerwald, Tobias Friedrich","submitted_at":"2017-06-26T15:12:25Z","abstract_excerpt":"Propositional satisfiability (SAT) is one of the most fundamental problems in computer science. The worst-case hardness of SAT lies at the core of computational complexity theory. The average-case analysis of SAT has triggered the development of sophisticated rigorous and non-rigorous techniques for analyzing random structures.\n  Despite a long line of research and substantial progress, nearly all theoretical work on random SAT assumes a uniform distribution on the variables. In contrast, real-world instances often exhibit large fluctuations in variable occurrence. This can be modeled by a sca"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.08431","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:47:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HDL+y5xmBkospatJ6MpzRjMT3dCRUu30uD7TNSftr7oOx3bPeibcwAnTTQAcr0bDJ3SKMSpdqSKD+00k7aM2CQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T08:35:12.871443Z"},"content_sha256":"001424112656569df66d926428c6ea514a42d141330c3e3cd9b8e9f987ed3178","schema_version":"1.0","event_id":"sha256:001424112656569df66d926428c6ea514a42d141330c3e3cd9b8e9f987ed3178"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/C47VLOBVVPGPLPD3RHLAHS2NHU/bundle.json","state_url":"https://pith.science/pith/C47VLOBVVPGPLPD3RHLAHS2NHU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/C47VLOBVVPGPLPD3RHLAHS2NHU/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-05-30T08:35:12Z","links":{"resolver":"https://pith.science/pith/C47VLOBVVPGPLPD3RHLAHS2NHU","bundle":"https://pith.science/pith/C47VLOBVVPGPLPD3RHLAHS2NHU/bundle.json","state":"https://pith.science/pith/C47VLOBVVPGPLPD3RHLAHS2NHU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/C47VLOBVVPGPLPD3RHLAHS2NHU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:C47VLOBVVPGPLPD3RHLAHS2NHU","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":"734518514282e6896de1d2c45791cbf9b7dd0b26f9836dd189ab0339a1666244","cross_cats_sorted":["cs.CC"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DM","submitted_at":"2017-06-26T15:12:25Z","title_canon_sha256":"5c69d464d066e2ea97199dcf7b1b0ceae235615c9d908a757b8eb1745e67a667"},"schema_version":"1.0","source":{"id":"1706.08431","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1706.08431","created_at":"2026-05-17T23:47:12Z"},{"alias_kind":"arxiv_version","alias_value":"1706.08431v1","created_at":"2026-05-17T23:47:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.08431","created_at":"2026-05-17T23:47:12Z"},{"alias_kind":"pith_short_12","alias_value":"C47VLOBVVPGP","created_at":"2026-05-18T12:31:08Z"},{"alias_kind":"pith_short_16","alias_value":"C47VLOBVVPGPLPD3","created_at":"2026-05-18T12:31:08Z"},{"alias_kind":"pith_short_8","alias_value":"C47VLOBV","created_at":"2026-05-18T12:31:08Z"}],"graph_snapshots":[{"event_id":"sha256:001424112656569df66d926428c6ea514a42d141330c3e3cd9b8e9f987ed3178","target":"graph","created_at":"2026-05-17T23:47:12Z","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":"Propositional satisfiability (SAT) is one of the most fundamental problems in computer science. The worst-case hardness of SAT lies at the core of computational complexity theory. The average-case analysis of SAT has triggered the development of sophisticated rigorous and non-rigorous techniques for analyzing random structures.\n  Despite a long line of research and substantial progress, nearly all theoretical work on random SAT assumes a uniform distribution on the variables. In contrast, real-world instances often exhibit large fluctuations in variable occurrence. This can be modeled by a sca","authors_text":"Andrew M. Sutton, Anton Krohmer, Ralf Rothenberger, Thomas Sauerwald, Tobias Friedrich","cross_cats":["cs.CC"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DM","submitted_at":"2017-06-26T15:12:25Z","title":"Bounds on the Satisfiability Threshold for Power Law Distributed Random SAT"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.08431","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:729811d01aad8b3932fc6326a63412d50f07189697f1c4296b1cf3a2ae122b66","target":"record","created_at":"2026-05-17T23:47:12Z","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":"734518514282e6896de1d2c45791cbf9b7dd0b26f9836dd189ab0339a1666244","cross_cats_sorted":["cs.CC"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DM","submitted_at":"2017-06-26T15:12:25Z","title_canon_sha256":"5c69d464d066e2ea97199dcf7b1b0ceae235615c9d908a757b8eb1745e67a667"},"schema_version":"1.0","source":{"id":"1706.08431","kind":"arxiv","version":1}},"canonical_sha256":"173f55b835abccf5bc7b89d603cb4d3d1584d0213333dc7b9d0735703c7c8ad7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"173f55b835abccf5bc7b89d603cb4d3d1584d0213333dc7b9d0735703c7c8ad7","first_computed_at":"2026-05-17T23:47:12.853381Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:47:12.853381Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"j0JzcwTAYhZ+uUp0GZbU4ojFadDGTycEudd5Vec75zsqPu35gaAPzlepYi4XuBVTiDT2dhZ0rp47F0rIjgKXAA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:47:12.853787Z","signed_message":"canonical_sha256_bytes"},"source_id":"1706.08431","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:729811d01aad8b3932fc6326a63412d50f07189697f1c4296b1cf3a2ae122b66","sha256:001424112656569df66d926428c6ea514a42d141330c3e3cd9b8e9f987ed3178"],"state_sha256":"4cd467b67c40c902375f49b0c0269f6388c34f6a20da09becee09bc9ba9118e8"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nSoqNltfLSIgUMOCzm6EL9lM8sVTXNTQdcN7zq2XpjHYFIuzx4I6jGLQXeQFUs+94lBi/Gx6LfI+TCXkR3z6AQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T08:35:12.874120Z","bundle_sha256":"9fb844a5afa3adecae40e995b772a019a33f9d72eeecbe580f15fa5a0c69660d"}}