{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:75CIGB46PFETLJJ7K6UY44ZZ55","short_pith_number":"pith:75CIGB46","canonical_record":{"source":{"id":"1603.08113","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2016-03-26T14:56:35Z","cross_cats_sorted":["cs.IT","math.IT","stat.ME","stat.ML","stat.TH"],"title_canon_sha256":"415d125767bd1f27a82ef7a5b6c0505e7df5a2f3e74e9e844239475d1dca4716","abstract_canon_sha256":"70a30f7db18adab56d27f5effceb13bb98dd79f9dc3c32e8876d6f09a4cbcbf5"},"schema_version":"1.0"},"canonical_sha256":"ff4483079e794935a53f57a98e7339ef47428437127c2da12cc503f9871453b9","source":{"kind":"arxiv","id":"1603.08113","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1603.08113","created_at":"2026-05-18T00:48:42Z"},{"alias_kind":"arxiv_version","alias_value":"1603.08113v3","created_at":"2026-05-18T00:48:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.08113","created_at":"2026-05-18T00:48:42Z"},{"alias_kind":"pith_short_12","alias_value":"75CIGB46PFET","created_at":"2026-05-18T12:30:04Z"},{"alias_kind":"pith_short_16","alias_value":"75CIGB46PFETLJJ7","created_at":"2026-05-18T12:30:04Z"},{"alias_kind":"pith_short_8","alias_value":"75CIGB46","created_at":"2026-05-18T12:30:04Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:75CIGB46PFETLJJ7K6UY44ZZ55","target":"record","payload":{"canonical_record":{"source":{"id":"1603.08113","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2016-03-26T14:56:35Z","cross_cats_sorted":["cs.IT","math.IT","stat.ME","stat.ML","stat.TH"],"title_canon_sha256":"415d125767bd1f27a82ef7a5b6c0505e7df5a2f3e74e9e844239475d1dca4716","abstract_canon_sha256":"70a30f7db18adab56d27f5effceb13bb98dd79f9dc3c32e8876d6f09a4cbcbf5"},"schema_version":"1.0"},"canonical_sha256":"ff4483079e794935a53f57a98e7339ef47428437127c2da12cc503f9871453b9","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:48:42.927576Z","signature_b64":"soTJSdJJEmleI8Ti7CCwQ/4mRj1qssMM5ZNG+57MidksPvI1Ker6ZrEvyMOhZhlf9LJK7ZFsEhFDPM3N4w/TDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ff4483079e794935a53f57a98e7339ef47428437127c2da12cc503f9871453b9","last_reissued_at":"2026-05-18T00:48:42.927156Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:48:42.927156Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1603.08113","source_version":3,"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:48:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dKdYEixjf+Ts9V2aaN90uFIh/Oa4ELfDzvfwzDF8cSVX+kmTiYaCxF7l6jvF52+ugyIHJSvjASoaqjxwcI84Ag==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T13:49:18.174794Z"},"content_sha256":"54a3fff12b32ec224aca94615acd39053c210d1e8acf98a610563a02614c0383","schema_version":"1.0","event_id":"sha256:54a3fff12b32ec224aca94615acd39053c210d1e8acf98a610563a02614c0383"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:75CIGB46PFETLJJ7K6UY44ZZ55","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Reconstructing undirected graphs from eigenspaces","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT","stat.ME","stat.ML","stat.TH"],"primary_cat":"math.ST","authors_text":"Paul Rochet, Thibault Espinasse, Yohann De Castro","submitted_at":"2016-03-26T14:56:35Z","abstract_excerpt":"In this paper, we aim at recovering an undirected weighted graph of $N$ vertices from the knowledge of a perturbed version of the eigenspaces of its adjacency matrix $W$. For instance, this situation arises for stationary signals on graphs or for Markov chains observed at random times. Our approach is based on minimizing a cost function given by the Frobenius norm of the commutator $\\mathsf{A} \\mathsf{B}-\\mathsf{B} \\mathsf{A}$ between symmetric matrices $\\mathsf{A}$ and $\\mathsf{B}$.\n  In the Erd\\H{o}s-R\\'enyi model with no self-loops, we show that identifiability (i.e., the ability to reconst"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1603.08113","kind":"arxiv","version":3},"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:48:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DEzt5A/z6Elx6/LQjRC8WExZzd1r14/V8ndiINiBowkcQUbM7Iq4Mkhin+rH2oN8kSoIM6MjNWBYDDmUm+qNBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T13:49:18.175150Z"},"content_sha256":"aacde6691381236ff902d70a87d82d925228fb8c8a9dee304f3c8d1c700f06d1","schema_version":"1.0","event_id":"sha256:aacde6691381236ff902d70a87d82d925228fb8c8a9dee304f3c8d1c700f06d1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/75CIGB46PFETLJJ7K6UY44ZZ55/bundle.json","state_url":"https://pith.science/pith/75CIGB46PFETLJJ7K6UY44ZZ55/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/75CIGB46PFETLJJ7K6UY44ZZ55/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-30T13:49:18Z","links":{"resolver":"https://pith.science/pith/75CIGB46PFETLJJ7K6UY44ZZ55","bundle":"https://pith.science/pith/75CIGB46PFETLJJ7K6UY44ZZ55/bundle.json","state":"https://pith.science/pith/75CIGB46PFETLJJ7K6UY44ZZ55/state.json","well_known_bundle":"https://pith.science/.well-known/pith/75CIGB46PFETLJJ7K6UY44ZZ55/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:75CIGB46PFETLJJ7K6UY44ZZ55","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":"70a30f7db18adab56d27f5effceb13bb98dd79f9dc3c32e8876d6f09a4cbcbf5","cross_cats_sorted":["cs.IT","math.IT","stat.ME","stat.ML","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2016-03-26T14:56:35Z","title_canon_sha256":"415d125767bd1f27a82ef7a5b6c0505e7df5a2f3e74e9e844239475d1dca4716"},"schema_version":"1.0","source":{"id":"1603.08113","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1603.08113","created_at":"2026-05-18T00:48:42Z"},{"alias_kind":"arxiv_version","alias_value":"1603.08113v3","created_at":"2026-05-18T00:48:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.08113","created_at":"2026-05-18T00:48:42Z"},{"alias_kind":"pith_short_12","alias_value":"75CIGB46PFET","created_at":"2026-05-18T12:30:04Z"},{"alias_kind":"pith_short_16","alias_value":"75CIGB46PFETLJJ7","created_at":"2026-05-18T12:30:04Z"},{"alias_kind":"pith_short_8","alias_value":"75CIGB46","created_at":"2026-05-18T12:30:04Z"}],"graph_snapshots":[{"event_id":"sha256:aacde6691381236ff902d70a87d82d925228fb8c8a9dee304f3c8d1c700f06d1","target":"graph","created_at":"2026-05-18T00:48:42Z","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 aim at recovering an undirected weighted graph of $N$ vertices from the knowledge of a perturbed version of the eigenspaces of its adjacency matrix $W$. For instance, this situation arises for stationary signals on graphs or for Markov chains observed at random times. Our approach is based on minimizing a cost function given by the Frobenius norm of the commutator $\\mathsf{A} \\mathsf{B}-\\mathsf{B} \\mathsf{A}$ between symmetric matrices $\\mathsf{A}$ and $\\mathsf{B}$.\n  In the Erd\\H{o}s-R\\'enyi model with no self-loops, we show that identifiability (i.e., the ability to reconst","authors_text":"Paul Rochet, Thibault Espinasse, Yohann De Castro","cross_cats":["cs.IT","math.IT","stat.ME","stat.ML","stat.TH"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2016-03-26T14:56:35Z","title":"Reconstructing undirected graphs from eigenspaces"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1603.08113","kind":"arxiv","version":3},"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:54a3fff12b32ec224aca94615acd39053c210d1e8acf98a610563a02614c0383","target":"record","created_at":"2026-05-18T00:48:42Z","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":"70a30f7db18adab56d27f5effceb13bb98dd79f9dc3c32e8876d6f09a4cbcbf5","cross_cats_sorted":["cs.IT","math.IT","stat.ME","stat.ML","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2016-03-26T14:56:35Z","title_canon_sha256":"415d125767bd1f27a82ef7a5b6c0505e7df5a2f3e74e9e844239475d1dca4716"},"schema_version":"1.0","source":{"id":"1603.08113","kind":"arxiv","version":3}},"canonical_sha256":"ff4483079e794935a53f57a98e7339ef47428437127c2da12cc503f9871453b9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ff4483079e794935a53f57a98e7339ef47428437127c2da12cc503f9871453b9","first_computed_at":"2026-05-18T00:48:42.927156Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:48:42.927156Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"soTJSdJJEmleI8Ti7CCwQ/4mRj1qssMM5ZNG+57MidksPvI1Ker6ZrEvyMOhZhlf9LJK7ZFsEhFDPM3N4w/TDA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:48:42.927576Z","signed_message":"canonical_sha256_bytes"},"source_id":"1603.08113","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:54a3fff12b32ec224aca94615acd39053c210d1e8acf98a610563a02614c0383","sha256:aacde6691381236ff902d70a87d82d925228fb8c8a9dee304f3c8d1c700f06d1"],"state_sha256":"a489c9c28f508e359a66be58c539eac31ccfb375b0d725569f3f311e98bb210e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DqGN2+JP0Soim3GQ9cPJhTXkrg1p71CwuopICg5fSVUbY5sqnPOGPnJckJ5DfHWDKuDWvCkaWutIZR6Nzh2mCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T13:49:18.177285Z","bundle_sha256":"b6a08cb77d1b142d9a6f899361cd51d562e5a41b44aa9ea5873be38df6fc5164"}}