{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:ITREL3YD6XZTB4K535AORNTYNK","short_pith_number":"pith:ITREL3YD","schema_version":"1.0","canonical_sha256":"44e245ef03f5f330f15ddf40e8b6786a9afe7e67c94557e6225fc292d1d518b6","source":{"kind":"arxiv","id":"1907.03467","version":2},"attestation_state":"computed","paper":{"title":"Graph Signal Processing -- Part I: Graphs, Graph Spectra, and Spectral Clustering","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["eess.SP","math.IT"],"primary_cat":"cs.IT","authors_text":"Bruno Scalzo, Danilo Mandic, Ljubisa Stankovic, Milos Brajovic, Milos Dakovic, Tony Constantinides","submitted_at":"2019-07-08T09:09:11Z","abstract_excerpt":"The area of Data Analytics on graphs promises a paradigm shift as we approach information processing of classes of data, which are typically acquired on irregular but structured domains (social networks, various ad-hoc sensor networks). Yet, despite its long history, current approaches mostly focus on the optimization of graphs themselves, rather than on directly inferring learning strategies, such as detection, estimation, statistical and probabilistic inference, clustering and separation from signals and data acquired on graphs. To fill this void, we first revisit graph topologies from a Dat"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1907.03467","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-07-08T09:09:11Z","cross_cats_sorted":["eess.SP","math.IT"],"title_canon_sha256":"eeb7409d4e90e9bbc508c30e9dd674fb14caadd2f9468df515a9c55c162f0533","abstract_canon_sha256":"6a5f6dec6df86ca88ef580990e01ce92b67bc02f80a06d91c4c47fbd15fb06a6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T23:53:15.045718Z","signature_b64":"NxT82PBJ8wUz6GvjU3ToanGAH+09+z5jaW/wPm8pFRU2hNE2ORMVUocH83redPsi6GI986QlNxcCQ9NrwyHXAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"44e245ef03f5f330f15ddf40e8b6786a9afe7e67c94557e6225fc292d1d518b6","last_reissued_at":"2026-07-04T23:53:15.045179Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T23:53:15.045179Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Graph Signal Processing -- Part I: Graphs, Graph Spectra, and Spectral Clustering","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["eess.SP","math.IT"],"primary_cat":"cs.IT","authors_text":"Bruno Scalzo, Danilo Mandic, Ljubisa Stankovic, Milos Brajovic, Milos Dakovic, Tony Constantinides","submitted_at":"2019-07-08T09:09:11Z","abstract_excerpt":"The area of Data Analytics on graphs promises a paradigm shift as we approach information processing of classes of data, which are typically acquired on irregular but structured domains (social networks, various ad-hoc sensor networks). Yet, despite its long history, current approaches mostly focus on the optimization of graphs themselves, rather than on directly inferring learning strategies, such as detection, estimation, statistical and probabilistic inference, clustering and separation from signals and data acquired on graphs. To fill this void, we first revisit graph topologies from a Dat"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.03467","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1907.03467/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1907.03467","created_at":"2026-07-04T23:53:15.045235+00:00"},{"alias_kind":"arxiv_version","alias_value":"1907.03467v2","created_at":"2026-07-04T23:53:15.045235+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.03467","created_at":"2026-07-04T23:53:15.045235+00:00"},{"alias_kind":"pith_short_12","alias_value":"ITREL3YD6XZT","created_at":"2026-07-04T23:53:15.045235+00:00"},{"alias_kind":"pith_short_16","alias_value":"ITREL3YD6XZTB4K5","created_at":"2026-07-04T23:53:15.045235+00:00"},{"alias_kind":"pith_short_8","alias_value":"ITREL3YD","created_at":"2026-07-04T23:53:15.045235+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2602.20870","citing_title":"FGFRFT: Fast Graph Fractional Fourier Transform via Exact Spectral Splitting and Fourier-Series Approximation","ref_index":4,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/ITREL3YD6XZTB4K535AORNTYNK","json":"https://pith.science/pith/ITREL3YD6XZTB4K535AORNTYNK.json","graph_json":"https://pith.science/api/pith-number/ITREL3YD6XZTB4K535AORNTYNK/graph.json","events_json":"https://pith.science/api/pith-number/ITREL3YD6XZTB4K535AORNTYNK/events.json","paper":"https://pith.science/paper/ITREL3YD"},"agent_actions":{"view_html":"https://pith.science/pith/ITREL3YD6XZTB4K535AORNTYNK","download_json":"https://pith.science/pith/ITREL3YD6XZTB4K535AORNTYNK.json","view_paper":"https://pith.science/paper/ITREL3YD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1907.03467&json=true","fetch_graph":"https://pith.science/api/pith-number/ITREL3YD6XZTB4K535AORNTYNK/graph.json","fetch_events":"https://pith.science/api/pith-number/ITREL3YD6XZTB4K535AORNTYNK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ITREL3YD6XZTB4K535AORNTYNK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ITREL3YD6XZTB4K535AORNTYNK/action/storage_attestation","attest_author":"https://pith.science/pith/ITREL3YD6XZTB4K535AORNTYNK/action/author_attestation","sign_citation":"https://pith.science/pith/ITREL3YD6XZTB4K535AORNTYNK/action/citation_signature","submit_replication":"https://pith.science/pith/ITREL3YD6XZTB4K535AORNTYNK/action/replication_record"}},"created_at":"2026-07-04T23:53:15.045235+00:00","updated_at":"2026-07-04T23:53:15.045235+00:00"}