{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:5V5Q7QRKS4TB5L2P47LT5NLH3M","short_pith_number":"pith:5V5Q7QRK","schema_version":"1.0","canonical_sha256":"ed7b0fc22a97261eaf4fe7d73eb567db0db14f268a12c12a923560638d7e17e9","source":{"kind":"arxiv","id":"1803.06914","version":1},"attestation_state":"computed","paper":{"title":"Mixing Time of Markov chain of the Knapsack Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","math.PR"],"primary_cat":"math.CO","authors_text":"Carrie Rutherford, Koko K. Kayibi, S. Pirzada","submitted_at":"2018-03-11T15:14:52Z","abstract_excerpt":"To find the number of assignments of zeros and ones satisfying a specific Knapsack Problem is $\\#P$ hard, so only approximations are envisageable. A Markov chain allowing uniform sampling of all possible solutions is given by Luby, Randall and Sinclair. In 2005, Morris and Sinclair, by using a flow argument, have shown that the mixing time of this Markov chain is $\\mathcal{O}(n^{9/2+\\epsilon})$, for any $\\epsilon > 0$. By using a canonical path argument on the distributive lattice structure of the set of solutions, we obtain an improved bound, the mixing time is given as $\\tau_{_{x}}(\\epsilon)"},"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":"1803.06914","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-03-11T15:14:52Z","cross_cats_sorted":["cs.DS","math.PR"],"title_canon_sha256":"f968f6ac64dbd9997b025be1e9b2b701f66b626de3dc0b8c65c643523fb99f30","abstract_canon_sha256":"0797d979746827d44188167d4ef31fb8b573030f431c1750110a5a82621fe399"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:20:40.901495Z","signature_b64":"bnfps2fSPLERPbuHFJZL6wKvuAG5Dy5oxDd/HtuO1hqvt+gQ+POOGOkivApUb2xxYEK8LrYJ4r3MgJwTPJ7yAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ed7b0fc22a97261eaf4fe7d73eb567db0db14f268a12c12a923560638d7e17e9","last_reissued_at":"2026-05-18T00:20:40.900763Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:20:40.900763Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Mixing Time of Markov chain of the Knapsack Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","math.PR"],"primary_cat":"math.CO","authors_text":"Carrie Rutherford, Koko K. Kayibi, S. Pirzada","submitted_at":"2018-03-11T15:14:52Z","abstract_excerpt":"To find the number of assignments of zeros and ones satisfying a specific Knapsack Problem is $\\#P$ hard, so only approximations are envisageable. A Markov chain allowing uniform sampling of all possible solutions is given by Luby, Randall and Sinclair. In 2005, Morris and Sinclair, by using a flow argument, have shown that the mixing time of this Markov chain is $\\mathcal{O}(n^{9/2+\\epsilon})$, for any $\\epsilon > 0$. By using a canonical path argument on the distributive lattice structure of the set of solutions, we obtain an improved bound, the mixing time is given as $\\tau_{_{x}}(\\epsilon)"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.06914","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":"1803.06914","created_at":"2026-05-18T00:20:40.900877+00:00"},{"alias_kind":"arxiv_version","alias_value":"1803.06914v1","created_at":"2026-05-18T00:20:40.900877+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.06914","created_at":"2026-05-18T00:20:40.900877+00:00"},{"alias_kind":"pith_short_12","alias_value":"5V5Q7QRKS4TB","created_at":"2026-05-18T12:32:08.215937+00:00"},{"alias_kind":"pith_short_16","alias_value":"5V5Q7QRKS4TB5L2P","created_at":"2026-05-18T12:32:08.215937+00:00"},{"alias_kind":"pith_short_8","alias_value":"5V5Q7QRK","created_at":"2026-05-18T12:32:08.215937+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/5V5Q7QRKS4TB5L2P47LT5NLH3M","json":"https://pith.science/pith/5V5Q7QRKS4TB5L2P47LT5NLH3M.json","graph_json":"https://pith.science/api/pith-number/5V5Q7QRKS4TB5L2P47LT5NLH3M/graph.json","events_json":"https://pith.science/api/pith-number/5V5Q7QRKS4TB5L2P47LT5NLH3M/events.json","paper":"https://pith.science/paper/5V5Q7QRK"},"agent_actions":{"view_html":"https://pith.science/pith/5V5Q7QRKS4TB5L2P47LT5NLH3M","download_json":"https://pith.science/pith/5V5Q7QRKS4TB5L2P47LT5NLH3M.json","view_paper":"https://pith.science/paper/5V5Q7QRK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1803.06914&json=true","fetch_graph":"https://pith.science/api/pith-number/5V5Q7QRKS4TB5L2P47LT5NLH3M/graph.json","fetch_events":"https://pith.science/api/pith-number/5V5Q7QRKS4TB5L2P47LT5NLH3M/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5V5Q7QRKS4TB5L2P47LT5NLH3M/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5V5Q7QRKS4TB5L2P47LT5NLH3M/action/storage_attestation","attest_author":"https://pith.science/pith/5V5Q7QRKS4TB5L2P47LT5NLH3M/action/author_attestation","sign_citation":"https://pith.science/pith/5V5Q7QRKS4TB5L2P47LT5NLH3M/action/citation_signature","submit_replication":"https://pith.science/pith/5V5Q7QRKS4TB5L2P47LT5NLH3M/action/replication_record"}},"created_at":"2026-05-18T00:20:40.900877+00:00","updated_at":"2026-05-18T00:20:40.900877+00:00"}