{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:ZVM7QZ5APLPCYKANX4MQ5RHD5W","short_pith_number":"pith:ZVM7QZ5A","schema_version":"1.0","canonical_sha256":"cd59f867a07ade2c280dbf190ec4e3edb350afabeeb3cbd4d44a4a100063eccc","source":{"kind":"arxiv","id":"1405.0102","version":2},"attestation_state":"computed","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."},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1405.0102","created_at":"2026-05-18T02:45:31.383670+00:00"},{"alias_kind":"arxiv_version","alias_value":"1405.0102v2","created_at":"2026-05-18T02:45:31.383670+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1405.0102","created_at":"2026-05-18T02:45:31.383670+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZVM7QZ5APLPC","created_at":"2026-05-18T12:28:59.999130+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZVM7QZ5APLPCYKAN","created_at":"2026-05-18T12:28:59.999130+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZVM7QZ5A","created_at":"2026-05-18T12:28:59.999130+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/ZVM7QZ5APLPCYKANX4MQ5RHD5W","json":"https://pith.science/pith/ZVM7QZ5APLPCYKANX4MQ5RHD5W.json","graph_json":"https://pith.science/api/pith-number/ZVM7QZ5APLPCYKANX4MQ5RHD5W/graph.json","events_json":"https://pith.science/api/pith-number/ZVM7QZ5APLPCYKANX4MQ5RHD5W/events.json","paper":"https://pith.science/paper/ZVM7QZ5A"},"agent_actions":{"view_html":"https://pith.science/pith/ZVM7QZ5APLPCYKANX4MQ5RHD5W","download_json":"https://pith.science/pith/ZVM7QZ5APLPCYKANX4MQ5RHD5W.json","view_paper":"https://pith.science/paper/ZVM7QZ5A","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1405.0102&json=true","fetch_graph":"https://pith.science/api/pith-number/ZVM7QZ5APLPCYKANX4MQ5RHD5W/graph.json","fetch_events":"https://pith.science/api/pith-number/ZVM7QZ5APLPCYKANX4MQ5RHD5W/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZVM7QZ5APLPCYKANX4MQ5RHD5W/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZVM7QZ5APLPCYKANX4MQ5RHD5W/action/storage_attestation","attest_author":"https://pith.science/pith/ZVM7QZ5APLPCYKANX4MQ5RHD5W/action/author_attestation","sign_citation":"https://pith.science/pith/ZVM7QZ5APLPCYKANX4MQ5RHD5W/action/citation_signature","submit_replication":"https://pith.science/pith/ZVM7QZ5APLPCYKANX4MQ5RHD5W/action/replication_record"}},"created_at":"2026-05-18T02:45:31.383670+00:00","updated_at":"2026-05-18T02:45:31.383670+00:00"}