{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:DNNN26VE52IOP46H3TWFY56ONP","short_pith_number":"pith:DNNN26VE","canonical_record":{"source":{"id":"1305.6736","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2013-05-29T09:15:48Z","cross_cats_sorted":[],"title_canon_sha256":"ecdb76daff37dc5ed4ddab287674adc59b2793ae7a0c92def4176f8be4cef74c","abstract_canon_sha256":"0db03d405d4e441a68632de71655ffed5ad31b0c55305896242fe92959940bbd"},"schema_version":"1.0"},"canonical_sha256":"1b5add7aa4ee90e7f3c7dcec5c77ce6bf9b615e52f856049b9d99447fddd6a82","source":{"kind":"arxiv","id":"1305.6736","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1305.6736","created_at":"2026-05-18T03:22:18Z"},{"alias_kind":"arxiv_version","alias_value":"1305.6736v1","created_at":"2026-05-18T03:22:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1305.6736","created_at":"2026-05-18T03:22:18Z"},{"alias_kind":"pith_short_12","alias_value":"DNNN26VE52IO","created_at":"2026-05-18T12:27:43Z"},{"alias_kind":"pith_short_16","alias_value":"DNNN26VE52IOP46H","created_at":"2026-05-18T12:27:43Z"},{"alias_kind":"pith_short_8","alias_value":"DNNN26VE","created_at":"2026-05-18T12:27:43Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:DNNN26VE52IOP46H3TWFY56ONP","target":"record","payload":{"canonical_record":{"source":{"id":"1305.6736","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2013-05-29T09:15:48Z","cross_cats_sorted":[],"title_canon_sha256":"ecdb76daff37dc5ed4ddab287674adc59b2793ae7a0c92def4176f8be4cef74c","abstract_canon_sha256":"0db03d405d4e441a68632de71655ffed5ad31b0c55305896242fe92959940bbd"},"schema_version":"1.0"},"canonical_sha256":"1b5add7aa4ee90e7f3c7dcec5c77ce6bf9b615e52f856049b9d99447fddd6a82","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:22:18.028473Z","signature_b64":"TKxeWg3izD4zn2i+mWv1bR+kRmlMW6b+WG0EWzXDGq7po4fgLzOFyJYYti1N4nm0g5/KRSJTx3AHiK90oRHMCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1b5add7aa4ee90e7f3c7dcec5c77ce6bf9b615e52f856049b9d99447fddd6a82","last_reissued_at":"2026-05-18T03:22:18.027942Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:22:18.027942Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1305.6736","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-18T03:22:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uLJ/wPM+63jPTbBuEn9bsY3KfjByhV3FGhK/f6likU7yVHs7buFwsjUJ1LQUb1sgVqjm48HkmW8TK9DlaAL8Aw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-29T17:50:28.771771Z"},"content_sha256":"cad861337e6964e5fa73af40a078d8fa8953ec037d09955a1c6b49ab736b9591","schema_version":"1.0","event_id":"sha256:cad861337e6964e5fa73af40a078d8fa8953ec037d09955a1c6b49ab736b9591"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:DNNN26VE52IOP46H3TWFY56ONP","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"An Adaptive Sequential Monte Carlo Algorithm for Computing Permanents","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"stat.CO","authors_text":"Ajay Jasra, Junshan Wang","submitted_at":"2013-05-29T09:15:48Z","abstract_excerpt":"We consider the computation of the permanent of a binary n by n matrix. It is well- known that the exact computation is a #P complete problem. A variety of Markov chain Monte Carlo (MCMC) computational algorithms have been introduced in the literature whose cost, in order to achieve a given level of accuracy, is O(n^7 log^4(n)). These algorithms use a particular collection of probability distributions, the `ideal' of which, (in some sense) are not known and need to be approximated. In this paper we propose an adaptive sequential Monte Carlo (SMC) algorithm that can both estimate the permanent "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1305.6736","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-18T03:22:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rPKv0fmmCg1xLrjsRg334oI1JhYbTp5i8bmef4jMyFFpE3Yvjd5TzPlDIWVrX8N/R7J23HADIUqHuYou8JFWBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-29T17:50:28.772440Z"},"content_sha256":"a4c27834471b4bc0bf4dd326bd7de3552fdf2a1fc95dcb672b4476ec08be6228","schema_version":"1.0","event_id":"sha256:a4c27834471b4bc0bf4dd326bd7de3552fdf2a1fc95dcb672b4476ec08be6228"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DNNN26VE52IOP46H3TWFY56ONP/bundle.json","state_url":"https://pith.science/pith/DNNN26VE52IOP46H3TWFY56ONP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DNNN26VE52IOP46H3TWFY56ONP/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-29T17:50:28Z","links":{"resolver":"https://pith.science/pith/DNNN26VE52IOP46H3TWFY56ONP","bundle":"https://pith.science/pith/DNNN26VE52IOP46H3TWFY56ONP/bundle.json","state":"https://pith.science/pith/DNNN26VE52IOP46H3TWFY56ONP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DNNN26VE52IOP46H3TWFY56ONP/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:DNNN26VE52IOP46H3TWFY56ONP","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":"0db03d405d4e441a68632de71655ffed5ad31b0c55305896242fe92959940bbd","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2013-05-29T09:15:48Z","title_canon_sha256":"ecdb76daff37dc5ed4ddab287674adc59b2793ae7a0c92def4176f8be4cef74c"},"schema_version":"1.0","source":{"id":"1305.6736","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1305.6736","created_at":"2026-05-18T03:22:18Z"},{"alias_kind":"arxiv_version","alias_value":"1305.6736v1","created_at":"2026-05-18T03:22:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1305.6736","created_at":"2026-05-18T03:22:18Z"},{"alias_kind":"pith_short_12","alias_value":"DNNN26VE52IO","created_at":"2026-05-18T12:27:43Z"},{"alias_kind":"pith_short_16","alias_value":"DNNN26VE52IOP46H","created_at":"2026-05-18T12:27:43Z"},{"alias_kind":"pith_short_8","alias_value":"DNNN26VE","created_at":"2026-05-18T12:27:43Z"}],"graph_snapshots":[{"event_id":"sha256:a4c27834471b4bc0bf4dd326bd7de3552fdf2a1fc95dcb672b4476ec08be6228","target":"graph","created_at":"2026-05-18T03:22:18Z","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":"We consider the computation of the permanent of a binary n by n matrix. It is well- known that the exact computation is a #P complete problem. A variety of Markov chain Monte Carlo (MCMC) computational algorithms have been introduced in the literature whose cost, in order to achieve a given level of accuracy, is O(n^7 log^4(n)). These algorithms use a particular collection of probability distributions, the `ideal' of which, (in some sense) are not known and need to be approximated. In this paper we propose an adaptive sequential Monte Carlo (SMC) algorithm that can both estimate the permanent ","authors_text":"Ajay Jasra, Junshan Wang","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2013-05-29T09:15:48Z","title":"An Adaptive Sequential Monte Carlo Algorithm for Computing Permanents"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1305.6736","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:cad861337e6964e5fa73af40a078d8fa8953ec037d09955a1c6b49ab736b9591","target":"record","created_at":"2026-05-18T03:22:18Z","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":"0db03d405d4e441a68632de71655ffed5ad31b0c55305896242fe92959940bbd","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2013-05-29T09:15:48Z","title_canon_sha256":"ecdb76daff37dc5ed4ddab287674adc59b2793ae7a0c92def4176f8be4cef74c"},"schema_version":"1.0","source":{"id":"1305.6736","kind":"arxiv","version":1}},"canonical_sha256":"1b5add7aa4ee90e7f3c7dcec5c77ce6bf9b615e52f856049b9d99447fddd6a82","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1b5add7aa4ee90e7f3c7dcec5c77ce6bf9b615e52f856049b9d99447fddd6a82","first_computed_at":"2026-05-18T03:22:18.027942Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:22:18.027942Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"TKxeWg3izD4zn2i+mWv1bR+kRmlMW6b+WG0EWzXDGq7po4fgLzOFyJYYti1N4nm0g5/KRSJTx3AHiK90oRHMCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:22:18.028473Z","signed_message":"canonical_sha256_bytes"},"source_id":"1305.6736","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:cad861337e6964e5fa73af40a078d8fa8953ec037d09955a1c6b49ab736b9591","sha256:a4c27834471b4bc0bf4dd326bd7de3552fdf2a1fc95dcb672b4476ec08be6228"],"state_sha256":"92f36fae5dc245f942909c67ff94efa90948326ce0c36453f31a4716721aa130"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pE1FVuOhMi0BqGCO4jPjGI5Hbg4PTFzh1lbMIL61rLwfE7HT/yIBX6V78sjQVggsmNDYmuaO6yMVcgxYuVOqBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-29T17:50:28.776558Z","bundle_sha256":"f191df5354b932416aec7a5dda1a3b7912e7ea23691873d608da3af18f5e9e4b"}}