{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:C47VLOBVVPGPLPD3RHLAHS2NHU","short_pith_number":"pith:C47VLOBV","schema_version":"1.0","canonical_sha256":"173f55b835abccf5bc7b89d603cb4d3d1584d0213333dc7b9d0735703c7c8ad7","source":{"kind":"arxiv","id":"1706.08431","version":1},"attestation_state":"computed","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1706.08431","created_at":"2026-05-17T23:47:12.853443+00:00"},{"alias_kind":"arxiv_version","alias_value":"1706.08431v1","created_at":"2026-05-17T23:47:12.853443+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.08431","created_at":"2026-05-17T23:47:12.853443+00:00"},{"alias_kind":"pith_short_12","alias_value":"C47VLOBVVPGP","created_at":"2026-05-18T12:31:08.081275+00:00"},{"alias_kind":"pith_short_16","alias_value":"C47VLOBVVPGPLPD3","created_at":"2026-05-18T12:31:08.081275+00:00"},{"alias_kind":"pith_short_8","alias_value":"C47VLOBV","created_at":"2026-05-18T12:31:08.081275+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/C47VLOBVVPGPLPD3RHLAHS2NHU","json":"https://pith.science/pith/C47VLOBVVPGPLPD3RHLAHS2NHU.json","graph_json":"https://pith.science/api/pith-number/C47VLOBVVPGPLPD3RHLAHS2NHU/graph.json","events_json":"https://pith.science/api/pith-number/C47VLOBVVPGPLPD3RHLAHS2NHU/events.json","paper":"https://pith.science/paper/C47VLOBV"},"agent_actions":{"view_html":"https://pith.science/pith/C47VLOBVVPGPLPD3RHLAHS2NHU","download_json":"https://pith.science/pith/C47VLOBVVPGPLPD3RHLAHS2NHU.json","view_paper":"https://pith.science/paper/C47VLOBV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1706.08431&json=true","fetch_graph":"https://pith.science/api/pith-number/C47VLOBVVPGPLPD3RHLAHS2NHU/graph.json","fetch_events":"https://pith.science/api/pith-number/C47VLOBVVPGPLPD3RHLAHS2NHU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/C47VLOBVVPGPLPD3RHLAHS2NHU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/C47VLOBVVPGPLPD3RHLAHS2NHU/action/storage_attestation","attest_author":"https://pith.science/pith/C47VLOBVVPGPLPD3RHLAHS2NHU/action/author_attestation","sign_citation":"https://pith.science/pith/C47VLOBVVPGPLPD3RHLAHS2NHU/action/citation_signature","submit_replication":"https://pith.science/pith/C47VLOBVVPGPLPD3RHLAHS2NHU/action/replication_record"}},"created_at":"2026-05-17T23:47:12.853443+00:00","updated_at":"2026-05-17T23:47:12.853443+00:00"}