{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:ZVM7QZ5APLPCYKANX4MQ5RHD5W","short_pith_number":"pith:ZVM7QZ5A","canonical_record":{"source":{"id":"1405.0102","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-05-01T06:06:45Z","cross_cats_sorted":["math.IT","stat.CO"],"title_canon_sha256":"56e94c34d0683dd4b6a9708c6534be4067f2dbb17ea1f94397a66b1e656bf4e7","abstract_canon_sha256":"13cc103731df3023356ff709ea93d0ce0de57092d06890a4b306062ecb8b310a"},"schema_version":"1.0"},"canonical_sha256":"cd59f867a07ade2c280dbf190ec4e3edb350afabeeb3cbd4d44a4a100063eccc","source":{"kind":"arxiv","id":"1405.0102","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1405.0102","created_at":"2026-05-18T02:45:31Z"},{"alias_kind":"arxiv_version","alias_value":"1405.0102v2","created_at":"2026-05-18T02:45:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1405.0102","created_at":"2026-05-18T02:45:31Z"},{"alias_kind":"pith_short_12","alias_value":"ZVM7QZ5APLPC","created_at":"2026-05-18T12:28:59Z"},{"alias_kind":"pith_short_16","alias_value":"ZVM7QZ5APLPCYKAN","created_at":"2026-05-18T12:28:59Z"},{"alias_kind":"pith_short_8","alias_value":"ZVM7QZ5A","created_at":"2026-05-18T12:28:59Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:ZVM7QZ5APLPCYKANX4MQ5RHD5W","target":"record","payload":{"canonical_record":{"source":{"id":"1405.0102","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-05-01T06:06:45Z","cross_cats_sorted":["math.IT","stat.CO"],"title_canon_sha256":"56e94c34d0683dd4b6a9708c6534be4067f2dbb17ea1f94397a66b1e656bf4e7","abstract_canon_sha256":"13cc103731df3023356ff709ea93d0ce0de57092d06890a4b306062ecb8b310a"},"schema_version":"1.0"},"canonical_sha256":"cd59f867a07ade2c280dbf190ec4e3edb350afabeeb3cbd4d44a4a100063eccc","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:45:31.384119Z","signature_b64":"mvQS3njATA66cMKjNNc9TZqrakjVKRDZwUufFE9Z+Any6bhFSrlyg0+MGq+xAB5splIX8Z1I0wjWsuRXpckVBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cd59f867a07ade2c280dbf190ec4e3edb350afabeeb3cbd4d44a4a100063eccc","last_reissued_at":"2026-05-18T02:45:31.383579Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:45:31.383579Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1405.0102","source_version":2,"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-18T02:45:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"s9WsxPjz6nV1HgOnF6BfuGqqFKWYh8SnXgj5H4M/twoxRE5c/WhALpG1WXwb2TUCg2ReAmzU/x4qw9As7ojfAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T13:10:15.885941Z"},"content_sha256":"78ce87600dca6ed594b682c5706120cc93e9330077582a768da61f71807f292d","schema_version":"1.0","event_id":"sha256:78ce87600dca6ed594b682c5706120cc93e9330077582a768da61f71807f292d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:ZVM7QZ5APLPCYKANX4MQ5RHD5W","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Capacity estimation of two-dimensional channels using Sequential Monte Carlo","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT","stat.CO"],"primary_cat":"cs.IT","authors_text":"Christian A. Naesseth, Fredrik Lindsten, Thomas B. Sch\\\"on","submitted_at":"2014-05-01T06:06:45Z","abstract_excerpt":"We derive a new Sequential-Monte-Carlo-based algorithm to estimate the capacity of two-dimensional channel models. The focus is on computing the noiseless capacity of the 2-D one-infinity run-length limited constrained channel, but the underlying idea is generally applicable. The proposed algorithm is profiled against a state-of-the-art method, yielding more than an order of magnitude improvement in estimation accuracy for a given computation time."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1405.0102","kind":"arxiv","version":2},"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-18T02:45:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KtjGazuOitJkj/QF3YqlorkT5QwX/OqmIUI1SaTDV27dyqdjNd+Cu3vLGhSvWGomUh8F4ER0uSK78Iyhf2CGDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T13:10:15.886304Z"},"content_sha256":"070800ffae7d55195f49b904648469b5d02d3caa8d478ca1a664a560e5f4e216","schema_version":"1.0","event_id":"sha256:070800ffae7d55195f49b904648469b5d02d3caa8d478ca1a664a560e5f4e216"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZVM7QZ5APLPCYKANX4MQ5RHD5W/bundle.json","state_url":"https://pith.science/pith/ZVM7QZ5APLPCYKANX4MQ5RHD5W/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZVM7QZ5APLPCYKANX4MQ5RHD5W/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-11T13:10:15Z","links":{"resolver":"https://pith.science/pith/ZVM7QZ5APLPCYKANX4MQ5RHD5W","bundle":"https://pith.science/pith/ZVM7QZ5APLPCYKANX4MQ5RHD5W/bundle.json","state":"https://pith.science/pith/ZVM7QZ5APLPCYKANX4MQ5RHD5W/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZVM7QZ5APLPCYKANX4MQ5RHD5W/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:ZVM7QZ5APLPCYKANX4MQ5RHD5W","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":"13cc103731df3023356ff709ea93d0ce0de57092d06890a4b306062ecb8b310a","cross_cats_sorted":["math.IT","stat.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-05-01T06:06:45Z","title_canon_sha256":"56e94c34d0683dd4b6a9708c6534be4067f2dbb17ea1f94397a66b1e656bf4e7"},"schema_version":"1.0","source":{"id":"1405.0102","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1405.0102","created_at":"2026-05-18T02:45:31Z"},{"alias_kind":"arxiv_version","alias_value":"1405.0102v2","created_at":"2026-05-18T02:45:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1405.0102","created_at":"2026-05-18T02:45:31Z"},{"alias_kind":"pith_short_12","alias_value":"ZVM7QZ5APLPC","created_at":"2026-05-18T12:28:59Z"},{"alias_kind":"pith_short_16","alias_value":"ZVM7QZ5APLPCYKAN","created_at":"2026-05-18T12:28:59Z"},{"alias_kind":"pith_short_8","alias_value":"ZVM7QZ5A","created_at":"2026-05-18T12:28:59Z"}],"graph_snapshots":[{"event_id":"sha256:070800ffae7d55195f49b904648469b5d02d3caa8d478ca1a664a560e5f4e216","target":"graph","created_at":"2026-05-18T02:45:31Z","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 derive a new Sequential-Monte-Carlo-based algorithm to estimate the capacity of two-dimensional channel models. The focus is on computing the noiseless capacity of the 2-D one-infinity run-length limited constrained channel, but the underlying idea is generally applicable. The proposed algorithm is profiled against a state-of-the-art method, yielding more than an order of magnitude improvement in estimation accuracy for a given computation time.","authors_text":"Christian A. Naesseth, Fredrik Lindsten, Thomas B. Sch\\\"on","cross_cats":["math.IT","stat.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-05-01T06:06:45Z","title":"Capacity estimation of two-dimensional channels using Sequential Monte Carlo"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1405.0102","kind":"arxiv","version":2},"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:78ce87600dca6ed594b682c5706120cc93e9330077582a768da61f71807f292d","target":"record","created_at":"2026-05-18T02:45:31Z","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":"13cc103731df3023356ff709ea93d0ce0de57092d06890a4b306062ecb8b310a","cross_cats_sorted":["math.IT","stat.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-05-01T06:06:45Z","title_canon_sha256":"56e94c34d0683dd4b6a9708c6534be4067f2dbb17ea1f94397a66b1e656bf4e7"},"schema_version":"1.0","source":{"id":"1405.0102","kind":"arxiv","version":2}},"canonical_sha256":"cd59f867a07ade2c280dbf190ec4e3edb350afabeeb3cbd4d44a4a100063eccc","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"cd59f867a07ade2c280dbf190ec4e3edb350afabeeb3cbd4d44a4a100063eccc","first_computed_at":"2026-05-18T02:45:31.383579Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:45:31.383579Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"mvQS3njATA66cMKjNNc9TZqrakjVKRDZwUufFE9Z+Any6bhFSrlyg0+MGq+xAB5splIX8Z1I0wjWsuRXpckVBA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:45:31.384119Z","signed_message":"canonical_sha256_bytes"},"source_id":"1405.0102","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:78ce87600dca6ed594b682c5706120cc93e9330077582a768da61f71807f292d","sha256:070800ffae7d55195f49b904648469b5d02d3caa8d478ca1a664a560e5f4e216"],"state_sha256":"c426675b4f2db25942435bb9818f0966fe4e7c8dd68fcb52b6f4e7bdab793a0f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YTTLtfMqpXCgIDnKpHYzmadHDOktj/sX525hlWzyITHTPw2Tsa9jT6gGJAy9fcPd08QRx6pgKA6KYTppF9sGBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T13:10:15.888709Z","bundle_sha256":"578bd381bb20eb58a4b1eb157f9f91522d47caa524563258bcb605cc844b95d6"}}