{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:2DJTZN2O665MNKLZ2Y6U7F5KXU","short_pith_number":"pith:2DJTZN2O","canonical_record":{"source":{"id":"1810.13066","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SP","submitted_at":"2018-10-31T01:49:50Z","cross_cats_sorted":[],"title_canon_sha256":"1e2dcfc4ed3209f2a1120a8060ccce4f39b884bf75a08461b67e0b24f9f6daf4","abstract_canon_sha256":"b1d4937abccfb45d9d9ad5e9c178822e2eeaea1c58438c45fdb432dc4c981e4b"},"schema_version":"1.0"},"canonical_sha256":"d0d33cb74ef7bac6a979d63d4f97aabd39853218ee121a95bbe7353cc5a17378","source":{"kind":"arxiv","id":"1810.13066","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1810.13066","created_at":"2026-05-17T23:45:35Z"},{"alias_kind":"arxiv_version","alias_value":"1810.13066v1","created_at":"2026-05-17T23:45:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.13066","created_at":"2026-05-17T23:45:35Z"},{"alias_kind":"pith_short_12","alias_value":"2DJTZN2O665M","created_at":"2026-05-18T12:31:59Z"},{"alias_kind":"pith_short_16","alias_value":"2DJTZN2O665MNKLZ","created_at":"2026-05-18T12:31:59Z"},{"alias_kind":"pith_short_8","alias_value":"2DJTZN2O","created_at":"2026-05-18T12:31:59Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:2DJTZN2O665MNKLZ2Y6U7F5KXU","target":"record","payload":{"canonical_record":{"source":{"id":"1810.13066","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SP","submitted_at":"2018-10-31T01:49:50Z","cross_cats_sorted":[],"title_canon_sha256":"1e2dcfc4ed3209f2a1120a8060ccce4f39b884bf75a08461b67e0b24f9f6daf4","abstract_canon_sha256":"b1d4937abccfb45d9d9ad5e9c178822e2eeaea1c58438c45fdb432dc4c981e4b"},"schema_version":"1.0"},"canonical_sha256":"d0d33cb74ef7bac6a979d63d4f97aabd39853218ee121a95bbe7353cc5a17378","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:45:35.671987Z","signature_b64":"ne6Yw/EONa0EuKHvXBdSWiRy1Ptrz4zDgVYbr4/EAIe/kJwz663Ud5oDBcsEMPY0yKdXRjunays8illMvOGEAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d0d33cb74ef7bac6a979d63d4f97aabd39853218ee121a95bbe7353cc5a17378","last_reissued_at":"2026-05-17T23:45:35.671276Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:45:35.671276Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1810.13066","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-17T23:45:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"trku2adUUDY6oAXQw2Y5JDJVLUi3eczSCJwGC7KKMv5/yz0pcDcw1+GrW6Rsiw39zwHf1shrgjnlYjMfscNyAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T06:58:10.814912Z"},"content_sha256":"22fc5cdbd2cda1d588c52c753446226553bb6667e21cc152320aca94379fb9d1","schema_version":"1.0","event_id":"sha256:22fc5cdbd2cda1d588c52c753446226553bb6667e21cc152320aca94379fb9d1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:2DJTZN2O665MNKLZ2Y6U7F5KXU","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Connecting the Dots: Identifying Network Structure via Graph Signal Processing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"eess.SP","authors_text":"Alejandro Ribeiro, Antonio G. Marques, Gonzalo Mateos, Santiago Segarra","submitted_at":"2018-10-31T01:49:50Z","abstract_excerpt":"Network topology inference is a prominent problem in Network Science. Most graph signal processing (GSP) efforts to date assume that the underlying network is known, and then analyze how the graph's algebraic and spectral characteristics impact the properties of the graph signals of interest. Such an assumption is often untenable beyond applications dealing with e.g., directly observable social and infrastructure networks; and typically adopted graph construction schemes are largely informal, distinctly lacking an element of validation. This tutorial offers an overview of graph learning method"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.13066","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-17T23:45:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eGspjX2TA8d3T0AHMd2LUTfOMml6hqPbQnm0WrRcSj8WikyxUZDGXU8NKvy4DghvMJDQgZ6HuKGDbESD0GndCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T06:58:10.815297Z"},"content_sha256":"9628837d7bcf4155da0dad8793feb84303973ed6fac86410cb1446190e3676aa","schema_version":"1.0","event_id":"sha256:9628837d7bcf4155da0dad8793feb84303973ed6fac86410cb1446190e3676aa"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/2DJTZN2O665MNKLZ2Y6U7F5KXU/bundle.json","state_url":"https://pith.science/pith/2DJTZN2O665MNKLZ2Y6U7F5KXU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/2DJTZN2O665MNKLZ2Y6U7F5KXU/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-30T06:58:10Z","links":{"resolver":"https://pith.science/pith/2DJTZN2O665MNKLZ2Y6U7F5KXU","bundle":"https://pith.science/pith/2DJTZN2O665MNKLZ2Y6U7F5KXU/bundle.json","state":"https://pith.science/pith/2DJTZN2O665MNKLZ2Y6U7F5KXU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/2DJTZN2O665MNKLZ2Y6U7F5KXU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:2DJTZN2O665MNKLZ2Y6U7F5KXU","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":"b1d4937abccfb45d9d9ad5e9c178822e2eeaea1c58438c45fdb432dc4c981e4b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SP","submitted_at":"2018-10-31T01:49:50Z","title_canon_sha256":"1e2dcfc4ed3209f2a1120a8060ccce4f39b884bf75a08461b67e0b24f9f6daf4"},"schema_version":"1.0","source":{"id":"1810.13066","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1810.13066","created_at":"2026-05-17T23:45:35Z"},{"alias_kind":"arxiv_version","alias_value":"1810.13066v1","created_at":"2026-05-17T23:45:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.13066","created_at":"2026-05-17T23:45:35Z"},{"alias_kind":"pith_short_12","alias_value":"2DJTZN2O665M","created_at":"2026-05-18T12:31:59Z"},{"alias_kind":"pith_short_16","alias_value":"2DJTZN2O665MNKLZ","created_at":"2026-05-18T12:31:59Z"},{"alias_kind":"pith_short_8","alias_value":"2DJTZN2O","created_at":"2026-05-18T12:31:59Z"}],"graph_snapshots":[{"event_id":"sha256:9628837d7bcf4155da0dad8793feb84303973ed6fac86410cb1446190e3676aa","target":"graph","created_at":"2026-05-17T23:45: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":"Network topology inference is a prominent problem in Network Science. Most graph signal processing (GSP) efforts to date assume that the underlying network is known, and then analyze how the graph's algebraic and spectral characteristics impact the properties of the graph signals of interest. Such an assumption is often untenable beyond applications dealing with e.g., directly observable social and infrastructure networks; and typically adopted graph construction schemes are largely informal, distinctly lacking an element of validation. This tutorial offers an overview of graph learning method","authors_text":"Alejandro Ribeiro, Antonio G. Marques, Gonzalo Mateos, Santiago Segarra","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SP","submitted_at":"2018-10-31T01:49:50Z","title":"Connecting the Dots: Identifying Network Structure via Graph Signal Processing"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.13066","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:22fc5cdbd2cda1d588c52c753446226553bb6667e21cc152320aca94379fb9d1","target":"record","created_at":"2026-05-17T23:45: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":"b1d4937abccfb45d9d9ad5e9c178822e2eeaea1c58438c45fdb432dc4c981e4b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SP","submitted_at":"2018-10-31T01:49:50Z","title_canon_sha256":"1e2dcfc4ed3209f2a1120a8060ccce4f39b884bf75a08461b67e0b24f9f6daf4"},"schema_version":"1.0","source":{"id":"1810.13066","kind":"arxiv","version":1}},"canonical_sha256":"d0d33cb74ef7bac6a979d63d4f97aabd39853218ee121a95bbe7353cc5a17378","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d0d33cb74ef7bac6a979d63d4f97aabd39853218ee121a95bbe7353cc5a17378","first_computed_at":"2026-05-17T23:45:35.671276Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:45:35.671276Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ne6Yw/EONa0EuKHvXBdSWiRy1Ptrz4zDgVYbr4/EAIe/kJwz663Ud5oDBcsEMPY0yKdXRjunays8illMvOGEAw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:45:35.671987Z","signed_message":"canonical_sha256_bytes"},"source_id":"1810.13066","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:22fc5cdbd2cda1d588c52c753446226553bb6667e21cc152320aca94379fb9d1","sha256:9628837d7bcf4155da0dad8793feb84303973ed6fac86410cb1446190e3676aa"],"state_sha256":"c9ca3e722a8798b92d3a080b4364fe12b3c5ea3b3a4d6cf403fe06460edeebd0"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"O+jpHUv1mZZPgLegGVVOA3yp2NoO7EahCSq7uUkjrdGbkhwai/MWg6i2oa96CCmZaMAdjLmR/Ot93fAU2txyBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T06:58:10.818148Z","bundle_sha256":"0467e73d8f5093969cf6290f3a04121d50652df52160680e62d4931acc10ca28"}}