{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:L36TR6WHLFLNWIODP53SEMDVU5","short_pith_number":"pith:L36TR6WH","canonical_record":{"source":{"id":"1509.02297","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-09-08T09:32:57Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"0b91177cdf890f12a53192e7967822c4d8ff5a03206e5588545334e204dafcce","abstract_canon_sha256":"bce03446cae2303bcc882453fa92a7dc0698789cfb1d6c47eb6136db741cfc4b"},"schema_version":"1.0"},"canonical_sha256":"5efd38fac75956db21c37f77223075a75f2bded2451ea06cc250c8f819260089","source":{"kind":"arxiv","id":"1509.02297","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1509.02297","created_at":"2026-05-18T00:58:35Z"},{"alias_kind":"arxiv_version","alias_value":"1509.02297v1","created_at":"2026-05-18T00:58:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.02297","created_at":"2026-05-18T00:58:35Z"},{"alias_kind":"pith_short_12","alias_value":"L36TR6WHLFLN","created_at":"2026-05-18T12:29:29Z"},{"alias_kind":"pith_short_16","alias_value":"L36TR6WHLFLNWIOD","created_at":"2026-05-18T12:29:29Z"},{"alias_kind":"pith_short_8","alias_value":"L36TR6WH","created_at":"2026-05-18T12:29:29Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:L36TR6WHLFLNWIODP53SEMDVU5","target":"record","payload":{"canonical_record":{"source":{"id":"1509.02297","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-09-08T09:32:57Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"0b91177cdf890f12a53192e7967822c4d8ff5a03206e5588545334e204dafcce","abstract_canon_sha256":"bce03446cae2303bcc882453fa92a7dc0698789cfb1d6c47eb6136db741cfc4b"},"schema_version":"1.0"},"canonical_sha256":"5efd38fac75956db21c37f77223075a75f2bded2451ea06cc250c8f819260089","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:58:35.035219Z","signature_b64":"kKU/rWzyFtZyOUxmdu8nB+Iyd/yz3HOkgMnUARNl1D48cv8CNI1ZnQ2RQ8pdOuyBT1ORgMvWKDZy7zxYvbI/Bw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5efd38fac75956db21c37f77223075a75f2bded2451ea06cc250c8f819260089","last_reissued_at":"2026-05-18T00:58:35.034543Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:58:35.034543Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1509.02297","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:58:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SyxVf54GtxxqF+cExpH5T8Cq7zbK+e06u9FOhCVGOXzcZLSnewmuIgis0txOk45lCFBKlIUkbNi8/ZSwjoXHCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T13:47:47.862916Z"},"content_sha256":"4506653a55c94e74df9a46ebeb5ff353d45b5434b8dd591bfb19e88f57a8048c","schema_version":"1.0","event_id":"sha256:4506653a55c94e74df9a46ebeb5ff353d45b5434b8dd591bfb19e88f57a8048c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:L36TR6WHLFLNWIODP53SEMDVU5","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On Capacity Formulation with Stationary Inputs and Application to a Bit-Patterned Media Recording Channel Model","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Marc A. Armand, Phan-Minh Nguyen","submitted_at":"2015-09-08T09:32:57Z","abstract_excerpt":"In this correspondence, we illustrate among other things the use of the stationarity property of the set of capacity-achieving inputs in capacity calculations. In particular, as a case study, we consider a bit-patterned media recording channel model and formulate new lower and upper bounds on its capacity that yield improvements over existing results. Inspired by the observation that the new bounds are tight at low noise levels, we also characterize the capacity of this model as a series expansion in the low-noise regime.\n  The key to these results is the realization of stationarity in the sup"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1509.02297","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:58:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jkNQ0Z55suyzk3MVCLjvzd38zsqin+w1vWNDiJICDT70CxqiuJm0BlXvTCHYEA62eJpZkjuBLHeP+LjP4T2vDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T13:47:47.863261Z"},"content_sha256":"788189c36ce20f24253c10cf6f3ce57203b7a9e79338b2db11df94ee5b2626c5","schema_version":"1.0","event_id":"sha256:788189c36ce20f24253c10cf6f3ce57203b7a9e79338b2db11df94ee5b2626c5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/L36TR6WHLFLNWIODP53SEMDVU5/bundle.json","state_url":"https://pith.science/pith/L36TR6WHLFLNWIODP53SEMDVU5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/L36TR6WHLFLNWIODP53SEMDVU5/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-01T13:47:47Z","links":{"resolver":"https://pith.science/pith/L36TR6WHLFLNWIODP53SEMDVU5","bundle":"https://pith.science/pith/L36TR6WHLFLNWIODP53SEMDVU5/bundle.json","state":"https://pith.science/pith/L36TR6WHLFLNWIODP53SEMDVU5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/L36TR6WHLFLNWIODP53SEMDVU5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:L36TR6WHLFLNWIODP53SEMDVU5","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":"bce03446cae2303bcc882453fa92a7dc0698789cfb1d6c47eb6136db741cfc4b","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-09-08T09:32:57Z","title_canon_sha256":"0b91177cdf890f12a53192e7967822c4d8ff5a03206e5588545334e204dafcce"},"schema_version":"1.0","source":{"id":"1509.02297","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1509.02297","created_at":"2026-05-18T00:58:35Z"},{"alias_kind":"arxiv_version","alias_value":"1509.02297v1","created_at":"2026-05-18T00:58:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.02297","created_at":"2026-05-18T00:58:35Z"},{"alias_kind":"pith_short_12","alias_value":"L36TR6WHLFLN","created_at":"2026-05-18T12:29:29Z"},{"alias_kind":"pith_short_16","alias_value":"L36TR6WHLFLNWIOD","created_at":"2026-05-18T12:29:29Z"},{"alias_kind":"pith_short_8","alias_value":"L36TR6WH","created_at":"2026-05-18T12:29:29Z"}],"graph_snapshots":[{"event_id":"sha256:788189c36ce20f24253c10cf6f3ce57203b7a9e79338b2db11df94ee5b2626c5","target":"graph","created_at":"2026-05-18T00:58:35Z","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":"In this correspondence, we illustrate among other things the use of the stationarity property of the set of capacity-achieving inputs in capacity calculations. In particular, as a case study, we consider a bit-patterned media recording channel model and formulate new lower and upper bounds on its capacity that yield improvements over existing results. Inspired by the observation that the new bounds are tight at low noise levels, we also characterize the capacity of this model as a series expansion in the low-noise regime.\n  The key to these results is the realization of stationarity in the sup","authors_text":"Marc A. Armand, Phan-Minh Nguyen","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-09-08T09:32:57Z","title":"On Capacity Formulation with Stationary Inputs and Application to a Bit-Patterned Media Recording Channel Model"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1509.02297","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:4506653a55c94e74df9a46ebeb5ff353d45b5434b8dd591bfb19e88f57a8048c","target":"record","created_at":"2026-05-18T00:58:35Z","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":"bce03446cae2303bcc882453fa92a7dc0698789cfb1d6c47eb6136db741cfc4b","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-09-08T09:32:57Z","title_canon_sha256":"0b91177cdf890f12a53192e7967822c4d8ff5a03206e5588545334e204dafcce"},"schema_version":"1.0","source":{"id":"1509.02297","kind":"arxiv","version":1}},"canonical_sha256":"5efd38fac75956db21c37f77223075a75f2bded2451ea06cc250c8f819260089","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5efd38fac75956db21c37f77223075a75f2bded2451ea06cc250c8f819260089","first_computed_at":"2026-05-18T00:58:35.034543Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:58:35.034543Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"kKU/rWzyFtZyOUxmdu8nB+Iyd/yz3HOkgMnUARNl1D48cv8CNI1ZnQ2RQ8pdOuyBT1ORgMvWKDZy7zxYvbI/Bw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:58:35.035219Z","signed_message":"canonical_sha256_bytes"},"source_id":"1509.02297","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4506653a55c94e74df9a46ebeb5ff353d45b5434b8dd591bfb19e88f57a8048c","sha256:788189c36ce20f24253c10cf6f3ce57203b7a9e79338b2db11df94ee5b2626c5"],"state_sha256":"0660fe6215f4cd2b7529034874a417183f112ef72e78980562670569aa9e4cbb"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"U5F4jInGfaks+dIPWvToJRiF9LZ3hBG9HKh3NTKVGIlmSVXcqxgVQXPxkDDXK6IH46cwFHaLDWqkl+tlGsbTCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T13:47:47.865138Z","bundle_sha256":"fbb0f05895242faec0981f3ef2aa77694186a2ff51c222e4d1013ded0813aba1"}}