{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:USNTOVYDFWQSMHS7VIH5RLLN3M","short_pith_number":"pith:USNTOVYD","schema_version":"1.0","canonical_sha256":"a49b3757032da1261e5faa0fd8ad6ddb25ef8fcbdab35ec0f253fefd29831e97","source":{"kind":"arxiv","id":"1004.4230","version":1},"attestation_state":"computed","paper":{"title":"Numerical Solution-Space Analysis of Satisfiability Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cond-mat.dis-nn","authors_text":"A.K. Hartmann, Alexander Mann","submitted_at":"2010-04-23T21:51:02Z","abstract_excerpt":"The solution-space structure of the 3-Satisfiability Problem (3-SAT) is studied as a function of the control parameter alpha (ratio of number of clauses to the number of variables) using numerical simulations. For this purpose, one has to sample the solution space with uniform weight. It is shown here that standard stochastic local-search (SLS) algorithms like \"ASAT\" and \"MCMCMC\" (also known as \"parallel tempering\") exhibit a sampling bias. Nevertheless, unbiased samples of solutions can be obtained using the \"ballistic-networking approach\", which is introduced here. It is a generalization of "},"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":"1004.4230","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cond-mat.dis-nn","submitted_at":"2010-04-23T21:51:02Z","cross_cats_sorted":[],"title_canon_sha256":"d0683c171002f252391d050b1fdc310fd5dde9306a463d454cb435f898437060","abstract_canon_sha256":"e3aa658a7dfa94142c13c177855059fdc13926a8549bc53a8633b27029875db3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:07:54.378762Z","signature_b64":"XQHomh2qvZoHGRXdqrMNLIOOaAQvu6EFnGBDVo/ha3/0/my8w2isNlmfL7A+QLALIntcqKH/MDoreIbxI+ePDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a49b3757032da1261e5faa0fd8ad6ddb25ef8fcbdab35ec0f253fefd29831e97","last_reissued_at":"2026-05-18T02:07:54.378012Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:07:54.378012Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Numerical Solution-Space Analysis of Satisfiability Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cond-mat.dis-nn","authors_text":"A.K. Hartmann, Alexander Mann","submitted_at":"2010-04-23T21:51:02Z","abstract_excerpt":"The solution-space structure of the 3-Satisfiability Problem (3-SAT) is studied as a function of the control parameter alpha (ratio of number of clauses to the number of variables) using numerical simulations. For this purpose, one has to sample the solution space with uniform weight. It is shown here that standard stochastic local-search (SLS) algorithms like \"ASAT\" and \"MCMCMC\" (also known as \"parallel tempering\") exhibit a sampling bias. Nevertheless, unbiased samples of solutions can be obtained using the \"ballistic-networking approach\", which is introduced here. It is a generalization of "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1004.4230","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":"1004.4230","created_at":"2026-05-18T02:07:54.378132+00:00"},{"alias_kind":"arxiv_version","alias_value":"1004.4230v1","created_at":"2026-05-18T02:07:54.378132+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1004.4230","created_at":"2026-05-18T02:07:54.378132+00:00"},{"alias_kind":"pith_short_12","alias_value":"USNTOVYDFWQS","created_at":"2026-05-18T12:26:15.391820+00:00"},{"alias_kind":"pith_short_16","alias_value":"USNTOVYDFWQSMHS7","created_at":"2026-05-18T12:26:15.391820+00:00"},{"alias_kind":"pith_short_8","alias_value":"USNTOVYD","created_at":"2026-05-18T12:26:15.391820+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/USNTOVYDFWQSMHS7VIH5RLLN3M","json":"https://pith.science/pith/USNTOVYDFWQSMHS7VIH5RLLN3M.json","graph_json":"https://pith.science/api/pith-number/USNTOVYDFWQSMHS7VIH5RLLN3M/graph.json","events_json":"https://pith.science/api/pith-number/USNTOVYDFWQSMHS7VIH5RLLN3M/events.json","paper":"https://pith.science/paper/USNTOVYD"},"agent_actions":{"view_html":"https://pith.science/pith/USNTOVYDFWQSMHS7VIH5RLLN3M","download_json":"https://pith.science/pith/USNTOVYDFWQSMHS7VIH5RLLN3M.json","view_paper":"https://pith.science/paper/USNTOVYD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1004.4230&json=true","fetch_graph":"https://pith.science/api/pith-number/USNTOVYDFWQSMHS7VIH5RLLN3M/graph.json","fetch_events":"https://pith.science/api/pith-number/USNTOVYDFWQSMHS7VIH5RLLN3M/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/USNTOVYDFWQSMHS7VIH5RLLN3M/action/timestamp_anchor","attest_storage":"https://pith.science/pith/USNTOVYDFWQSMHS7VIH5RLLN3M/action/storage_attestation","attest_author":"https://pith.science/pith/USNTOVYDFWQSMHS7VIH5RLLN3M/action/author_attestation","sign_citation":"https://pith.science/pith/USNTOVYDFWQSMHS7VIH5RLLN3M/action/citation_signature","submit_replication":"https://pith.science/pith/USNTOVYDFWQSMHS7VIH5RLLN3M/action/replication_record"}},"created_at":"2026-05-18T02:07:54.378132+00:00","updated_at":"2026-05-18T02:07:54.378132+00:00"}