{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:BMF626XD5XGCIRIB3BXFVTVMZZ","short_pith_number":"pith:BMF626XD","canonical_record":{"source":{"id":"1806.04423","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-06-12T10:01:16Z","cross_cats_sorted":[],"title_canon_sha256":"2e2c481c8651ada30054eaec49d5dc84f4fad86af46526be6633b88f6143bdca","abstract_canon_sha256":"33c085ac14ee47193deb64094899f1f9dde15098bcbf7c1129c324af39af3ac5"},"schema_version":"1.0"},"canonical_sha256":"0b0bed7ae3edcc244501d86e5aceacce774985697c1da02fc2aa43d1f85dd31f","source":{"kind":"arxiv","id":"1806.04423","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1806.04423","created_at":"2026-05-18T00:13:35Z"},{"alias_kind":"arxiv_version","alias_value":"1806.04423v1","created_at":"2026-05-18T00:13:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.04423","created_at":"2026-05-18T00:13:35Z"},{"alias_kind":"pith_short_12","alias_value":"BMF626XD5XGC","created_at":"2026-05-18T12:32:16Z"},{"alias_kind":"pith_short_16","alias_value":"BMF626XD5XGCIRIB","created_at":"2026-05-18T12:32:16Z"},{"alias_kind":"pith_short_8","alias_value":"BMF626XD","created_at":"2026-05-18T12:32:16Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:BMF626XD5XGCIRIB3BXFVTVMZZ","target":"record","payload":{"canonical_record":{"source":{"id":"1806.04423","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-06-12T10:01:16Z","cross_cats_sorted":[],"title_canon_sha256":"2e2c481c8651ada30054eaec49d5dc84f4fad86af46526be6633b88f6143bdca","abstract_canon_sha256":"33c085ac14ee47193deb64094899f1f9dde15098bcbf7c1129c324af39af3ac5"},"schema_version":"1.0"},"canonical_sha256":"0b0bed7ae3edcc244501d86e5aceacce774985697c1da02fc2aa43d1f85dd31f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:13:35.558877Z","signature_b64":"m2+nIKRwSh5OuRIqNs6f/O4ODtHVtFv5jQn0P4u8ajGJeDoKMQ1nHjtfexjhmcK+kEF/F2zvPD3duDgsJI5/AA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0b0bed7ae3edcc244501d86e5aceacce774985697c1da02fc2aa43d1f85dd31f","last_reissued_at":"2026-05-18T00:13:35.558403Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:13:35.558403Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1806.04423","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:13:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EFGfoVjFG4Hb4o/zbcLP56aRQE+QCdnJyXsm8iqMPshz6xMyVx+0PeQi3NUru7n8yf32jPlbAXfGtu1IIdKoDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T18:58:36.446842Z"},"content_sha256":"68bbd8eff4656786b184d86372bae41a352f86a98a8755943a860edd7d9bd680","schema_version":"1.0","event_id":"sha256:68bbd8eff4656786b184d86372bae41a352f86a98a8755943a860edd7d9bd680"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:BMF626XD5XGCIRIB3BXFVTVMZZ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Identification of Sparse Reciprocal Graphical Models","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Augusto Ferrante, Daniele Alpago, Mattia Zorzi","submitted_at":"2018-06-12T10:01:16Z","abstract_excerpt":"In this paper we propose an identification procedure of a sparse graphical model associated to a Gaussian stationary stochastic process. The identification paradigm exploits the approximation of autoregressive processes through reciprocal processes in order to improve the robustness of the identification algorithm, especially when the order of the autoregressive process becomes large. We show that the proposed paradigm leads to a regularized, circulant matrix completion problem whose solution only requires computations of the eigenvalues of matrices of dimension equal to the dimension of the p"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.04423","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:13:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jb39ZhxEHJJj7e7TzP/Nu6/z6+ek3PfoKuwMNd7jSjmILUk6SDNo0lnwYnGtMhHD47b8FhNl7RWkcJJyr5pwAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T18:58:36.447517Z"},"content_sha256":"7769eb15d5c9579d8df7ee9bdfabd24e70e9f4c7aa597287ad9aef5acce4e927","schema_version":"1.0","event_id":"sha256:7769eb15d5c9579d8df7ee9bdfabd24e70e9f4c7aa597287ad9aef5acce4e927"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BMF626XD5XGCIRIB3BXFVTVMZZ/bundle.json","state_url":"https://pith.science/pith/BMF626XD5XGCIRIB3BXFVTVMZZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BMF626XD5XGCIRIB3BXFVTVMZZ/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-26T18:58:36Z","links":{"resolver":"https://pith.science/pith/BMF626XD5XGCIRIB3BXFVTVMZZ","bundle":"https://pith.science/pith/BMF626XD5XGCIRIB3BXFVTVMZZ/bundle.json","state":"https://pith.science/pith/BMF626XD5XGCIRIB3BXFVTVMZZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BMF626XD5XGCIRIB3BXFVTVMZZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:BMF626XD5XGCIRIB3BXFVTVMZZ","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":"33c085ac14ee47193deb64094899f1f9dde15098bcbf7c1129c324af39af3ac5","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-06-12T10:01:16Z","title_canon_sha256":"2e2c481c8651ada30054eaec49d5dc84f4fad86af46526be6633b88f6143bdca"},"schema_version":"1.0","source":{"id":"1806.04423","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1806.04423","created_at":"2026-05-18T00:13:35Z"},{"alias_kind":"arxiv_version","alias_value":"1806.04423v1","created_at":"2026-05-18T00:13:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.04423","created_at":"2026-05-18T00:13:35Z"},{"alias_kind":"pith_short_12","alias_value":"BMF626XD5XGC","created_at":"2026-05-18T12:32:16Z"},{"alias_kind":"pith_short_16","alias_value":"BMF626XD5XGCIRIB","created_at":"2026-05-18T12:32:16Z"},{"alias_kind":"pith_short_8","alias_value":"BMF626XD","created_at":"2026-05-18T12:32:16Z"}],"graph_snapshots":[{"event_id":"sha256:7769eb15d5c9579d8df7ee9bdfabd24e70e9f4c7aa597287ad9aef5acce4e927","target":"graph","created_at":"2026-05-18T00:13: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 paper we propose an identification procedure of a sparse graphical model associated to a Gaussian stationary stochastic process. The identification paradigm exploits the approximation of autoregressive processes through reciprocal processes in order to improve the robustness of the identification algorithm, especially when the order of the autoregressive process becomes large. We show that the proposed paradigm leads to a regularized, circulant matrix completion problem whose solution only requires computations of the eigenvalues of matrices of dimension equal to the dimension of the p","authors_text":"Augusto Ferrante, Daniele Alpago, Mattia Zorzi","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-06-12T10:01:16Z","title":"Identification of Sparse Reciprocal Graphical Models"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.04423","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:68bbd8eff4656786b184d86372bae41a352f86a98a8755943a860edd7d9bd680","target":"record","created_at":"2026-05-18T00:13: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":"33c085ac14ee47193deb64094899f1f9dde15098bcbf7c1129c324af39af3ac5","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-06-12T10:01:16Z","title_canon_sha256":"2e2c481c8651ada30054eaec49d5dc84f4fad86af46526be6633b88f6143bdca"},"schema_version":"1.0","source":{"id":"1806.04423","kind":"arxiv","version":1}},"canonical_sha256":"0b0bed7ae3edcc244501d86e5aceacce774985697c1da02fc2aa43d1f85dd31f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0b0bed7ae3edcc244501d86e5aceacce774985697c1da02fc2aa43d1f85dd31f","first_computed_at":"2026-05-18T00:13:35.558403Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:13:35.558403Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"m2+nIKRwSh5OuRIqNs6f/O4ODtHVtFv5jQn0P4u8ajGJeDoKMQ1nHjtfexjhmcK+kEF/F2zvPD3duDgsJI5/AA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:13:35.558877Z","signed_message":"canonical_sha256_bytes"},"source_id":"1806.04423","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:68bbd8eff4656786b184d86372bae41a352f86a98a8755943a860edd7d9bd680","sha256:7769eb15d5c9579d8df7ee9bdfabd24e70e9f4c7aa597287ad9aef5acce4e927"],"state_sha256":"c975206146e4aa5ed61db53354fe5277de70d262be2ab9419617194db0856f5f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GEY1bcGleykjVPxeigODO2UREaI+51DtivIC1HPixQc2HBRET5161+xfS1M3C76q44xNNwnAQYbgW0Ngw3BmAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T18:58:36.450632Z","bundle_sha256":"5fbbbd1642239ccd83dc4a11fcaf772b6c87b311ff7386ddb193d46ef5da055d"}}