{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2006:N2YGHJUMYSJTLHFPZPNQGRZGSE","short_pith_number":"pith:N2YGHJUM","canonical_record":{"source":{"id":"math/0606650","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2006-06-26T15:52:42Z","cross_cats_sorted":["math.CO","stat.TH"],"title_canon_sha256":"a213c2dda3ed475e54dc9a2f7e38a4ae9a5d035a55e2e521794a99826ab61830","abstract_canon_sha256":"e32ac1a6ba40e37ed746cab56f9fc826e234f5c5ea3820122a48e7d8bc8c8e2c"},"schema_version":"1.0"},"canonical_sha256":"6eb063a68cc493359cafcbdb03472691176bb70310e4fe4c6ef17f1c59538bb9","source":{"kind":"arxiv","id":"math/0606650","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"math/0606650","created_at":"2026-05-18T04:19:12Z"},{"alias_kind":"arxiv_version","alias_value":"math/0606650v3","created_at":"2026-05-18T04:19:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.math/0606650","created_at":"2026-05-18T04:19:12Z"},{"alias_kind":"pith_short_12","alias_value":"N2YGHJUMYSJT","created_at":"2026-05-18T12:25:54Z"},{"alias_kind":"pith_short_16","alias_value":"N2YGHJUMYSJTLHFP","created_at":"2026-05-18T12:25:54Z"},{"alias_kind":"pith_short_8","alias_value":"N2YGHJUM","created_at":"2026-05-18T12:25:54Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2006:N2YGHJUMYSJTLHFPZPNQGRZGSE","target":"record","payload":{"canonical_record":{"source":{"id":"math/0606650","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2006-06-26T15:52:42Z","cross_cats_sorted":["math.CO","stat.TH"],"title_canon_sha256":"a213c2dda3ed475e54dc9a2f7e38a4ae9a5d035a55e2e521794a99826ab61830","abstract_canon_sha256":"e32ac1a6ba40e37ed746cab56f9fc826e234f5c5ea3820122a48e7d8bc8c8e2c"},"schema_version":"1.0"},"canonical_sha256":"6eb063a68cc493359cafcbdb03472691176bb70310e4fe4c6ef17f1c59538bb9","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:19:12.537251Z","signature_b64":"NJO7EwESaLavi29qkAT3u3AZObjFe0hKa5L37FOLdzGijqlRwJe/rKSDcK0opY98VaIPo6maAKZ/MG3HoyvgDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6eb063a68cc493359cafcbdb03472691176bb70310e4fe4c6ef17f1c59538bb9","last_reissued_at":"2026-05-18T04:19:12.536733Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:19:12.536733Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"math/0606650","source_version":3,"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-18T04:19:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mkB3JQWpCE4smIMykCO2RhjzMQ2jtkeZji+uLmQLRZfhvVMtNfDZJ1g8a900+zaYl6EhTu1Xoc8OUYEgAdcKDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T23:07:29.383585Z"},"content_sha256":"d805ede30e36e0d3914ad229488ffc40aa4e888ce30044a82c4d8a16b11ea902","schema_version":"1.0","event_id":"sha256:d805ede30e36e0d3914ad229488ffc40aa4e888ce30044a82c4d8a16b11ea902"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2006:N2YGHJUMYSJTLHFPZPNQGRZGSE","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Negative Examples for Sequential Importance Sampling of Binary Contingency Tables","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO","stat.TH"],"primary_cat":"math.ST","authors_text":"Alistair Sinclair, Daniel Stefankovic, Eric Vigoda, Ivona Bezakova","submitted_at":"2006-06-26T15:52:42Z","abstract_excerpt":"The sequential importance sampling (SIS) algorithm has gained considerable popularity for its empirical success. One of its noted applications is to the binary contingency tables problem, an important problem in statistics, where the goal is to estimate the number of 0/1 matrices with prescribed row and column sums. We give a family of examples in which the SIS procedure, if run for any subexponential number of trials, will underestimate the number of tables by an exponential factor. This result holds for any of the usual design choices in the SIS algorithm, namely the ordering of the columns "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"math/0606650","kind":"arxiv","version":3},"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-18T04:19:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RNGcwQ15ZWpDI3Nua4c22wPj5s10Nr2+wvARpRgnlFg0iN7WptAigHD8YrVUM1+cbS/QEYo0X95K/R5wQcm7Dg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T23:07:29.384246Z"},"content_sha256":"6d4bcbe08d1c25bc1290eb62f2bd56768aaaa38dab6666bf8543fb491229f0b9","schema_version":"1.0","event_id":"sha256:6d4bcbe08d1c25bc1290eb62f2bd56768aaaa38dab6666bf8543fb491229f0b9"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/N2YGHJUMYSJTLHFPZPNQGRZGSE/bundle.json","state_url":"https://pith.science/pith/N2YGHJUMYSJTLHFPZPNQGRZGSE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/N2YGHJUMYSJTLHFPZPNQGRZGSE/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-05-31T23:07:29Z","links":{"resolver":"https://pith.science/pith/N2YGHJUMYSJTLHFPZPNQGRZGSE","bundle":"https://pith.science/pith/N2YGHJUMYSJTLHFPZPNQGRZGSE/bundle.json","state":"https://pith.science/pith/N2YGHJUMYSJTLHFPZPNQGRZGSE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/N2YGHJUMYSJTLHFPZPNQGRZGSE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2006:N2YGHJUMYSJTLHFPZPNQGRZGSE","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":"e32ac1a6ba40e37ed746cab56f9fc826e234f5c5ea3820122a48e7d8bc8c8e2c","cross_cats_sorted":["math.CO","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2006-06-26T15:52:42Z","title_canon_sha256":"a213c2dda3ed475e54dc9a2f7e38a4ae9a5d035a55e2e521794a99826ab61830"},"schema_version":"1.0","source":{"id":"math/0606650","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"math/0606650","created_at":"2026-05-18T04:19:12Z"},{"alias_kind":"arxiv_version","alias_value":"math/0606650v3","created_at":"2026-05-18T04:19:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.math/0606650","created_at":"2026-05-18T04:19:12Z"},{"alias_kind":"pith_short_12","alias_value":"N2YGHJUMYSJT","created_at":"2026-05-18T12:25:54Z"},{"alias_kind":"pith_short_16","alias_value":"N2YGHJUMYSJTLHFP","created_at":"2026-05-18T12:25:54Z"},{"alias_kind":"pith_short_8","alias_value":"N2YGHJUM","created_at":"2026-05-18T12:25:54Z"}],"graph_snapshots":[{"event_id":"sha256:6d4bcbe08d1c25bc1290eb62f2bd56768aaaa38dab6666bf8543fb491229f0b9","target":"graph","created_at":"2026-05-18T04:19:12Z","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":"The sequential importance sampling (SIS) algorithm has gained considerable popularity for its empirical success. One of its noted applications is to the binary contingency tables problem, an important problem in statistics, where the goal is to estimate the number of 0/1 matrices with prescribed row and column sums. We give a family of examples in which the SIS procedure, if run for any subexponential number of trials, will underestimate the number of tables by an exponential factor. This result holds for any of the usual design choices in the SIS algorithm, namely the ordering of the columns ","authors_text":"Alistair Sinclair, Daniel Stefankovic, Eric Vigoda, Ivona Bezakova","cross_cats":["math.CO","stat.TH"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2006-06-26T15:52:42Z","title":"Negative Examples for Sequential Importance Sampling of Binary Contingency Tables"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"math/0606650","kind":"arxiv","version":3},"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:d805ede30e36e0d3914ad229488ffc40aa4e888ce30044a82c4d8a16b11ea902","target":"record","created_at":"2026-05-18T04:19:12Z","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":"e32ac1a6ba40e37ed746cab56f9fc826e234f5c5ea3820122a48e7d8bc8c8e2c","cross_cats_sorted":["math.CO","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2006-06-26T15:52:42Z","title_canon_sha256":"a213c2dda3ed475e54dc9a2f7e38a4ae9a5d035a55e2e521794a99826ab61830"},"schema_version":"1.0","source":{"id":"math/0606650","kind":"arxiv","version":3}},"canonical_sha256":"6eb063a68cc493359cafcbdb03472691176bb70310e4fe4c6ef17f1c59538bb9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6eb063a68cc493359cafcbdb03472691176bb70310e4fe4c6ef17f1c59538bb9","first_computed_at":"2026-05-18T04:19:12.536733Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:19:12.536733Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"NJO7EwESaLavi29qkAT3u3AZObjFe0hKa5L37FOLdzGijqlRwJe/rKSDcK0opY98VaIPo6maAKZ/MG3HoyvgDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T04:19:12.537251Z","signed_message":"canonical_sha256_bytes"},"source_id":"math/0606650","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d805ede30e36e0d3914ad229488ffc40aa4e888ce30044a82c4d8a16b11ea902","sha256:6d4bcbe08d1c25bc1290eb62f2bd56768aaaa38dab6666bf8543fb491229f0b9"],"state_sha256":"9ed9307b3330b55ec2eff512052b1a03f96adf042a8ccd5a78cbcfa062192e98"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OD6x+u0MJ3q1Pif8NEvMcedCKt2yhwycrbXVSqsOIa1UZ/rPEfdhToB5WsrvihwF1VBftsOZB8rvUlXsYP7WAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T23:07:29.388526Z","bundle_sha256":"0b916afb2443aa592cc808a7cc90e47bc1f1b8d219b55b69156b14db417553f3"}}