{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:EYG43NUQJHH26BNRMX3ZLZKZWL","short_pith_number":"pith:EYG43NUQ","canonical_record":{"source":{"id":"1107.2465","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2011-07-13T05:18:59Z","cross_cats_sorted":["cs.IT","cs.SY","math.IT"],"title_canon_sha256":"1d3b0fecfc0e04a652c3d6320e4a325e17158b3ce3bd1f065250eb65797c372a","abstract_canon_sha256":"8f437b3e4c5365ce49b4551541c1cf45426182753661417277e871ef56405397"},"schema_version":"1.0"},"canonical_sha256":"260dcdb69049cfaf05b165f795e559b2f082d6e2948c4602a5d16cdebb93aade","source":{"kind":"arxiv","id":"1107.2465","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1107.2465","created_at":"2026-05-18T00:18:56Z"},{"alias_kind":"arxiv_version","alias_value":"1107.2465v2","created_at":"2026-05-18T00:18:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1107.2465","created_at":"2026-05-18T00:18:56Z"},{"alias_kind":"pith_short_12","alias_value":"EYG43NUQJHH2","created_at":"2026-05-18T12:26:28Z"},{"alias_kind":"pith_short_16","alias_value":"EYG43NUQJHH26BNR","created_at":"2026-05-18T12:26:28Z"},{"alias_kind":"pith_short_8","alias_value":"EYG43NUQ","created_at":"2026-05-18T12:26:28Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:EYG43NUQJHH26BNRMX3ZLZKZWL","target":"record","payload":{"canonical_record":{"source":{"id":"1107.2465","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2011-07-13T05:18:59Z","cross_cats_sorted":["cs.IT","cs.SY","math.IT"],"title_canon_sha256":"1d3b0fecfc0e04a652c3d6320e4a325e17158b3ce3bd1f065250eb65797c372a","abstract_canon_sha256":"8f437b3e4c5365ce49b4551541c1cf45426182753661417277e871ef56405397"},"schema_version":"1.0"},"canonical_sha256":"260dcdb69049cfaf05b165f795e559b2f082d6e2948c4602a5d16cdebb93aade","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:18:56.290143Z","signature_b64":"02Z2GiSJPFt0s693j8dHSptAPh1X2TsoOCWXGTaCzdHBqyDG2BQB111Utp+GDSIf4hjJ1LrpRpoCawN7efnRAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"260dcdb69049cfaf05b165f795e559b2f082d6e2948c4602a5d16cdebb93aade","last_reissued_at":"2026-05-18T00:18:56.289733Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:18:56.289733Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1107.2465","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-18T00:18:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7jtreqxfbpN/PM1+GN0f+VT/uGjDmZj1UpTqDuarPJUAa2HGg2Z/TykcJZy7Na1sXJWrvxw/mnvvFPO1QtlJAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T19:47:26.106433Z"},"content_sha256":"b33cc40c3e6a2a916c3bd83a875da791a87ef0cdbe350497cc99315bf952b39e","schema_version":"1.0","event_id":"sha256:b33cc40c3e6a2a916c3bd83a875da791a87ef0cdbe350497cc99315bf952b39e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:EYG43NUQJHH26BNRMX3ZLZKZWL","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"An Efficient Algorithm for Maximum-Entropy Extension of Block-Circulant Covariance Matrices","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","cs.SY","math.IT"],"primary_cat":"math.OC","authors_text":"Augusto Ferrante, Francesca P. Carli, Giorgio Picci, Michele Pavon","submitted_at":"2011-07-13T05:18:59Z","abstract_excerpt":"This paper deals with maximum entropy completion of partially specified block-circulant matrices. Since positive definite symmetric circulants happen to be covariance matrices of stationary periodic processes, in particular of stationary reciprocal processes, this problem has applications in signal processing, in particular to image modeling. In fact it is strictly related to maximum likelihood estimation of bilateral AR-type representations of acausal signals subject to certain conditional independence constraints. The maximum entropy completion problem for block-circulant matrices has recent"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1107.2465","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-18T00:18:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wxhzMDXY9LZO7OY3r73ymRqaYJqrnZUj4qNC2pbD//fd1aipHmTiZGrk3YwfWHwMsusztNSJ1U8wWREbw0ZVBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T19:47:26.106783Z"},"content_sha256":"959430bc09aa385efda4e164401eeb7d2b8f62e1aeed2daeac69f6a74d775da1","schema_version":"1.0","event_id":"sha256:959430bc09aa385efda4e164401eeb7d2b8f62e1aeed2daeac69f6a74d775da1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/EYG43NUQJHH26BNRMX3ZLZKZWL/bundle.json","state_url":"https://pith.science/pith/EYG43NUQJHH26BNRMX3ZLZKZWL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/EYG43NUQJHH26BNRMX3ZLZKZWL/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-03T19:47:26Z","links":{"resolver":"https://pith.science/pith/EYG43NUQJHH26BNRMX3ZLZKZWL","bundle":"https://pith.science/pith/EYG43NUQJHH26BNRMX3ZLZKZWL/bundle.json","state":"https://pith.science/pith/EYG43NUQJHH26BNRMX3ZLZKZWL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/EYG43NUQJHH26BNRMX3ZLZKZWL/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:EYG43NUQJHH26BNRMX3ZLZKZWL","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":"8f437b3e4c5365ce49b4551541c1cf45426182753661417277e871ef56405397","cross_cats_sorted":["cs.IT","cs.SY","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2011-07-13T05:18:59Z","title_canon_sha256":"1d3b0fecfc0e04a652c3d6320e4a325e17158b3ce3bd1f065250eb65797c372a"},"schema_version":"1.0","source":{"id":"1107.2465","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1107.2465","created_at":"2026-05-18T00:18:56Z"},{"alias_kind":"arxiv_version","alias_value":"1107.2465v2","created_at":"2026-05-18T00:18:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1107.2465","created_at":"2026-05-18T00:18:56Z"},{"alias_kind":"pith_short_12","alias_value":"EYG43NUQJHH2","created_at":"2026-05-18T12:26:28Z"},{"alias_kind":"pith_short_16","alias_value":"EYG43NUQJHH26BNR","created_at":"2026-05-18T12:26:28Z"},{"alias_kind":"pith_short_8","alias_value":"EYG43NUQ","created_at":"2026-05-18T12:26:28Z"}],"graph_snapshots":[{"event_id":"sha256:959430bc09aa385efda4e164401eeb7d2b8f62e1aeed2daeac69f6a74d775da1","target":"graph","created_at":"2026-05-18T00:18:56Z","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":"This paper deals with maximum entropy completion of partially specified block-circulant matrices. Since positive definite symmetric circulants happen to be covariance matrices of stationary periodic processes, in particular of stationary reciprocal processes, this problem has applications in signal processing, in particular to image modeling. In fact it is strictly related to maximum likelihood estimation of bilateral AR-type representations of acausal signals subject to certain conditional independence constraints. The maximum entropy completion problem for block-circulant matrices has recent","authors_text":"Augusto Ferrante, Francesca P. Carli, Giorgio Picci, Michele Pavon","cross_cats":["cs.IT","cs.SY","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2011-07-13T05:18:59Z","title":"An Efficient Algorithm for Maximum-Entropy Extension of Block-Circulant Covariance Matrices"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1107.2465","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:b33cc40c3e6a2a916c3bd83a875da791a87ef0cdbe350497cc99315bf952b39e","target":"record","created_at":"2026-05-18T00:18:56Z","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":"8f437b3e4c5365ce49b4551541c1cf45426182753661417277e871ef56405397","cross_cats_sorted":["cs.IT","cs.SY","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2011-07-13T05:18:59Z","title_canon_sha256":"1d3b0fecfc0e04a652c3d6320e4a325e17158b3ce3bd1f065250eb65797c372a"},"schema_version":"1.0","source":{"id":"1107.2465","kind":"arxiv","version":2}},"canonical_sha256":"260dcdb69049cfaf05b165f795e559b2f082d6e2948c4602a5d16cdebb93aade","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"260dcdb69049cfaf05b165f795e559b2f082d6e2948c4602a5d16cdebb93aade","first_computed_at":"2026-05-18T00:18:56.289733Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:18:56.289733Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"02Z2GiSJPFt0s693j8dHSptAPh1X2TsoOCWXGTaCzdHBqyDG2BQB111Utp+GDSIf4hjJ1LrpRpoCawN7efnRAA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:18:56.290143Z","signed_message":"canonical_sha256_bytes"},"source_id":"1107.2465","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b33cc40c3e6a2a916c3bd83a875da791a87ef0cdbe350497cc99315bf952b39e","sha256:959430bc09aa385efda4e164401eeb7d2b8f62e1aeed2daeac69f6a74d775da1"],"state_sha256":"af9d43aa6fe89301de62c9711a09aad44b02812e93668dcbbc1440294b2a571d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Hc2oMJH/MRdF95qAMdg8UDPrd0maRiRaPROCljniSSOTnRBQsb156b6m66cEW/c8dqJbW/xrvHTitxH0FKxlAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T19:47:26.108930Z","bundle_sha256":"15b6fa9ccaa01bfd7df1c2e0b49f0f60abd9b74f3b5ba97c544ce8e10202203c"}}