{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:WYNQJMSI4BDSBLFJY6OQL5EK5P","short_pith_number":"pith:WYNQJMSI","schema_version":"1.0","canonical_sha256":"b61b04b248e04720aca9c79d05f48aebc2dd246ad63f5100e7690d4012100c88","source":{"kind":"arxiv","id":"1906.05127","version":1},"attestation_state":"computed","paper":{"title":"Biased random k-SAT","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.PR"],"primary_cat":"math.CO","authors_text":"Joel Larsson, Klas Markstr\\\"om","submitted_at":"2019-06-12T13:20:34Z","abstract_excerpt":"The basic random $k$-SAT problem is: Given a set of $n$ Boolean variables, and $m$ clauses of size $k$ picked uniformly at random from the set of all such clauses on our variables, is the conjunction of these clauses satisfiable?\n  Here we consider a variation of this problem where there is a bias towards variables occurring positive -- i.e. variables occur negated w.p. $0<p< \\frac{1}{2}$ and positive otherwise -- and study how the satisfiability threshold depends on $p$. For $p<\\frac{1}{2}$ this model breaks many of the symmetries of the original random $k$-SAT problem, e.g. the distribution "},"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":"1906.05127","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-06-12T13:20:34Z","cross_cats_sorted":["math.PR"],"title_canon_sha256":"710cd03fd0cb84e98da0b246dd589b6fd26ea1827a318175389998dc210a0620","abstract_canon_sha256":"ccecbe60856e8defed42171bca3e8e885daff6a666c02885772b70ceea901250"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:43:29.391244Z","signature_b64":"gqPxqByqizNp+d57kOGm/86wftTFoNxAr/HICL+wwPfRbIq2J7h7x++Ng/toRQxa6GNb5OlAc4ESNEPyXa4dAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b61b04b248e04720aca9c79d05f48aebc2dd246ad63f5100e7690d4012100c88","last_reissued_at":"2026-05-17T23:43:29.390615Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:43:29.390615Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Biased random k-SAT","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.PR"],"primary_cat":"math.CO","authors_text":"Joel Larsson, Klas Markstr\\\"om","submitted_at":"2019-06-12T13:20:34Z","abstract_excerpt":"The basic random $k$-SAT problem is: Given a set of $n$ Boolean variables, and $m$ clauses of size $k$ picked uniformly at random from the set of all such clauses on our variables, is the conjunction of these clauses satisfiable?\n  Here we consider a variation of this problem where there is a bias towards variables occurring positive -- i.e. variables occur negated w.p. $0<p< \\frac{1}{2}$ and positive otherwise -- and study how the satisfiability threshold depends on $p$. For $p<\\frac{1}{2}$ this model breaks many of the symmetries of the original random $k$-SAT problem, e.g. the distribution "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1906.05127","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":"1906.05127","created_at":"2026-05-17T23:43:29.390737+00:00"},{"alias_kind":"arxiv_version","alias_value":"1906.05127v1","created_at":"2026-05-17T23:43:29.390737+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1906.05127","created_at":"2026-05-17T23:43:29.390737+00:00"},{"alias_kind":"pith_short_12","alias_value":"WYNQJMSI4BDS","created_at":"2026-05-18T12:33:33.725879+00:00"},{"alias_kind":"pith_short_16","alias_value":"WYNQJMSI4BDSBLFJ","created_at":"2026-05-18T12:33:33.725879+00:00"},{"alias_kind":"pith_short_8","alias_value":"WYNQJMSI","created_at":"2026-05-18T12:33:33.725879+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/WYNQJMSI4BDSBLFJY6OQL5EK5P","json":"https://pith.science/pith/WYNQJMSI4BDSBLFJY6OQL5EK5P.json","graph_json":"https://pith.science/api/pith-number/WYNQJMSI4BDSBLFJY6OQL5EK5P/graph.json","events_json":"https://pith.science/api/pith-number/WYNQJMSI4BDSBLFJY6OQL5EK5P/events.json","paper":"https://pith.science/paper/WYNQJMSI"},"agent_actions":{"view_html":"https://pith.science/pith/WYNQJMSI4BDSBLFJY6OQL5EK5P","download_json":"https://pith.science/pith/WYNQJMSI4BDSBLFJY6OQL5EK5P.json","view_paper":"https://pith.science/paper/WYNQJMSI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1906.05127&json=true","fetch_graph":"https://pith.science/api/pith-number/WYNQJMSI4BDSBLFJY6OQL5EK5P/graph.json","fetch_events":"https://pith.science/api/pith-number/WYNQJMSI4BDSBLFJY6OQL5EK5P/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WYNQJMSI4BDSBLFJY6OQL5EK5P/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WYNQJMSI4BDSBLFJY6OQL5EK5P/action/storage_attestation","attest_author":"https://pith.science/pith/WYNQJMSI4BDSBLFJY6OQL5EK5P/action/author_attestation","sign_citation":"https://pith.science/pith/WYNQJMSI4BDSBLFJY6OQL5EK5P/action/citation_signature","submit_replication":"https://pith.science/pith/WYNQJMSI4BDSBLFJY6OQL5EK5P/action/replication_record"}},"created_at":"2026-05-17T23:43:29.390737+00:00","updated_at":"2026-05-17T23:43:29.390737+00:00"}