{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:5V5Q7QRKS4TB5L2P47LT5NLH3M","short_pith_number":"pith:5V5Q7QRK","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"},"canonical_sha256":"ed7b0fc22a97261eaf4fe7d73eb567db0db14f268a12c12a923560638d7e17e9","source":{"kind":"arxiv","id":"1803.06914","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1803.06914","created_at":"2026-05-18T00:20:40Z"},{"alias_kind":"arxiv_version","alias_value":"1803.06914v1","created_at":"2026-05-18T00:20:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.06914","created_at":"2026-05-18T00:20:40Z"},{"alias_kind":"pith_short_12","alias_value":"5V5Q7QRKS4TB","created_at":"2026-05-18T12:32:08Z"},{"alias_kind":"pith_short_16","alias_value":"5V5Q7QRKS4TB5L2P","created_at":"2026-05-18T12:32:08Z"},{"alias_kind":"pith_short_8","alias_value":"5V5Q7QRK","created_at":"2026-05-18T12:32:08Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:5V5Q7QRKS4TB5L2P47LT5NLH3M","target":"record","payload":{"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"},"canonical_sha256":"ed7b0fc22a97261eaf4fe7d73eb567db0db14f268a12c12a923560638d7e17e9","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"},"source_kind":"arxiv","source_id":"1803.06914","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-18T00:20:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rl7dIsTklAQAeXOtaE2Y5xB8yQyGHs2zYuddFRS9BCSwfoyRPDhfy7OgVtzHAiSLbZFHQbKS4AfXKk2zv5FYCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T15:27:03.491716Z"},"content_sha256":"3ca34995b1dcf032ca84318224432af50e220b70ecd86d7796792282fc82663a","schema_version":"1.0","event_id":"sha256:3ca34995b1dcf032ca84318224432af50e220b70ecd86d7796792282fc82663a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:5V5Q7QRKS4TB5L2P47LT5NLH3M","target":"graph","payload":{"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"},"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-18T00:20:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NnC9zpyLyvzl+pLf6QU0E7W05DyktHYaL5GTG0Kq3p2IOASao5Qjydl4KfZEH11M8t+OmWrlVwrpreP02jHPBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T15:27:03.492438Z"},"content_sha256":"064e2115490148406de64d7e9bd78a39a0070bbe54a75cc83d2c9f9362e6a482","schema_version":"1.0","event_id":"sha256:064e2115490148406de64d7e9bd78a39a0070bbe54a75cc83d2c9f9362e6a482"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5V5Q7QRKS4TB5L2P47LT5NLH3M/bundle.json","state_url":"https://pith.science/pith/5V5Q7QRKS4TB5L2P47LT5NLH3M/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5V5Q7QRKS4TB5L2P47LT5NLH3M/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-06-06T15:27:03Z","links":{"resolver":"https://pith.science/pith/5V5Q7QRKS4TB5L2P47LT5NLH3M","bundle":"https://pith.science/pith/5V5Q7QRKS4TB5L2P47LT5NLH3M/bundle.json","state":"https://pith.science/pith/5V5Q7QRKS4TB5L2P47LT5NLH3M/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5V5Q7QRKS4TB5L2P47LT5NLH3M/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:5V5Q7QRKS4TB5L2P47LT5NLH3M","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":"0797d979746827d44188167d4ef31fb8b573030f431c1750110a5a82621fe399","cross_cats_sorted":["cs.DS","math.PR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-03-11T15:14:52Z","title_canon_sha256":"f968f6ac64dbd9997b025be1e9b2b701f66b626de3dc0b8c65c643523fb99f30"},"schema_version":"1.0","source":{"id":"1803.06914","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1803.06914","created_at":"2026-05-18T00:20:40Z"},{"alias_kind":"arxiv_version","alias_value":"1803.06914v1","created_at":"2026-05-18T00:20:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.06914","created_at":"2026-05-18T00:20:40Z"},{"alias_kind":"pith_short_12","alias_value":"5V5Q7QRKS4TB","created_at":"2026-05-18T12:32:08Z"},{"alias_kind":"pith_short_16","alias_value":"5V5Q7QRKS4TB5L2P","created_at":"2026-05-18T12:32:08Z"},{"alias_kind":"pith_short_8","alias_value":"5V5Q7QRK","created_at":"2026-05-18T12:32:08Z"}],"graph_snapshots":[{"event_id":"sha256:064e2115490148406de64d7e9bd78a39a0070bbe54a75cc83d2c9f9362e6a482","target":"graph","created_at":"2026-05-18T00:20:40Z","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":"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)","authors_text":"Carrie Rutherford, Koko K. Kayibi, S. Pirzada","cross_cats":["cs.DS","math.PR"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-03-11T15:14:52Z","title":"Mixing Time of Markov chain of the Knapsack Problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.06914","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:3ca34995b1dcf032ca84318224432af50e220b70ecd86d7796792282fc82663a","target":"record","created_at":"2026-05-18T00:20:40Z","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":"0797d979746827d44188167d4ef31fb8b573030f431c1750110a5a82621fe399","cross_cats_sorted":["cs.DS","math.PR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-03-11T15:14:52Z","title_canon_sha256":"f968f6ac64dbd9997b025be1e9b2b701f66b626de3dc0b8c65c643523fb99f30"},"schema_version":"1.0","source":{"id":"1803.06914","kind":"arxiv","version":1}},"canonical_sha256":"ed7b0fc22a97261eaf4fe7d73eb567db0db14f268a12c12a923560638d7e17e9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ed7b0fc22a97261eaf4fe7d73eb567db0db14f268a12c12a923560638d7e17e9","first_computed_at":"2026-05-18T00:20:40.900763Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:20:40.900763Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"bnfps2fSPLERPbuHFJZL6wKvuAG5Dy5oxDd/HtuO1hqvt+gQ+POOGOkivApUb2xxYEK8LrYJ4r3MgJwTPJ7yAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:20:40.901495Z","signed_message":"canonical_sha256_bytes"},"source_id":"1803.06914","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3ca34995b1dcf032ca84318224432af50e220b70ecd86d7796792282fc82663a","sha256:064e2115490148406de64d7e9bd78a39a0070bbe54a75cc83d2c9f9362e6a482"],"state_sha256":"2796760acca896c7fd592b761913064f578293bfac85d84849be1b6ab0b676f1"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"m+I9kcdVws3M/rme+VLxuBW5+pbGLFxmLKJOiTdt2L6I/YGijjxIKPvqSGtl9af4xvdXjcPGDgc1BSX+gru2Dw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-06T15:27:03.496054Z","bundle_sha256":"35e8d2185db95f190cbe543d121d5aa2971d236b200de582546a5f3d074a58c6"}}