{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2009:VBLXEXR2BT2C7DKBS5KN5MFGK3","short_pith_number":"pith:VBLXEXR2","schema_version":"1.0","canonical_sha256":"a857725e3a0cf42f8d419754deb0a656e22b5e504fc959d776a8da9c4d0f1a48","source":{"kind":"arxiv","id":"0912.3848","version":1},"attestation_state":"computed","paper":{"title":"Wavelets on Graphs via Spectral Graph Theory","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"math.FA","authors_text":"David K Hammond, Pierre Vandergheynst, R\\'emi Gribonval","submitted_at":"2009-12-19T00:50:02Z","abstract_excerpt":"We propose a novel method for constructing wavelet transforms of functions defined on the vertices of an arbitrary finite weighted graph. Our approach is based on defining scaling using the the graph analogue of the Fourier domain, namely the spectral decomposition of the discrete graph Laplacian $\\L$. Given a wavelet generating kernel $g$ and a scale parameter $t$, we define the scaled wavelet operator $T_g^t = g(t\\L)$. The spectral graph wavelets are then formed by localizing this operator by applying it to an indicator function. Subject to an admissibility condition on $g$, this procedure d"},"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":"0912.3848","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.FA","submitted_at":"2009-12-19T00:50:02Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"d6be9d5e9d78df32bde97c0c13078e60eec20f63744becc6062783a8c8eae364","abstract_canon_sha256":"8a64388d0d886cc2151e211764503b43e0ec2d379dd272f109ba0b72f615a642"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T17:18:09.093098Z","signature_b64":"xQEnKG+7NMQ5TqvtbU7jYBNWkFXBjH5s+iC3svQzur2uDkpz3Cn2N3hO4ZN10MmBgTMnve/KceNu1+YG12/xCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a857725e3a0cf42f8d419754deb0a656e22b5e504fc959d776a8da9c4d0f1a48","last_reissued_at":"2026-07-04T17:18:09.092692Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T17:18:09.092692Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Wavelets on Graphs via Spectral Graph Theory","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"math.FA","authors_text":"David K Hammond, Pierre Vandergheynst, R\\'emi Gribonval","submitted_at":"2009-12-19T00:50:02Z","abstract_excerpt":"We propose a novel method for constructing wavelet transforms of functions defined on the vertices of an arbitrary finite weighted graph. Our approach is based on defining scaling using the the graph analogue of the Fourier domain, namely the spectral decomposition of the discrete graph Laplacian $\\L$. Given a wavelet generating kernel $g$ and a scale parameter $t$, we define the scaled wavelet operator $T_g^t = g(t\\L)$. The spectral graph wavelets are then formed by localizing this operator by applying it to an indicator function. Subject to an admissibility condition on $g$, this procedure d"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0912.3848","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/0912.3848/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":"0912.3848","created_at":"2026-07-04T17:18:09.092754+00:00"},{"alias_kind":"arxiv_version","alias_value":"0912.3848v1","created_at":"2026-07-04T17:18:09.092754+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0912.3848","created_at":"2026-07-04T17:18:09.092754+00:00"},{"alias_kind":"pith_short_12","alias_value":"VBLXEXR2BT2C","created_at":"2026-07-04T17:18:09.092754+00:00"},{"alias_kind":"pith_short_16","alias_value":"VBLXEXR2BT2C7DKB","created_at":"2026-07-04T17:18:09.092754+00:00"},{"alias_kind":"pith_short_8","alias_value":"VBLXEXR2","created_at":"2026-07-04T17:18:09.092754+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":2,"sample":[{"citing_arxiv_id":"2606.03315","citing_title":"A Graph Foundation Model with Spectral Parsing and Prototype-Guided Spatial Propagation","ref_index":34,"is_internal_anchor":true},{"citing_arxiv_id":"2512.07420","citing_title":"KIGNet: Physics-Motivated Multi-Graph Representation Learning for Explainable Jet Tagging","ref_index":16,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/VBLXEXR2BT2C7DKBS5KN5MFGK3","json":"https://pith.science/pith/VBLXEXR2BT2C7DKBS5KN5MFGK3.json","graph_json":"https://pith.science/api/pith-number/VBLXEXR2BT2C7DKBS5KN5MFGK3/graph.json","events_json":"https://pith.science/api/pith-number/VBLXEXR2BT2C7DKBS5KN5MFGK3/events.json","paper":"https://pith.science/paper/VBLXEXR2"},"agent_actions":{"view_html":"https://pith.science/pith/VBLXEXR2BT2C7DKBS5KN5MFGK3","download_json":"https://pith.science/pith/VBLXEXR2BT2C7DKBS5KN5MFGK3.json","view_paper":"https://pith.science/paper/VBLXEXR2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=0912.3848&json=true","fetch_graph":"https://pith.science/api/pith-number/VBLXEXR2BT2C7DKBS5KN5MFGK3/graph.json","fetch_events":"https://pith.science/api/pith-number/VBLXEXR2BT2C7DKBS5KN5MFGK3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VBLXEXR2BT2C7DKBS5KN5MFGK3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VBLXEXR2BT2C7DKBS5KN5MFGK3/action/storage_attestation","attest_author":"https://pith.science/pith/VBLXEXR2BT2C7DKBS5KN5MFGK3/action/author_attestation","sign_citation":"https://pith.science/pith/VBLXEXR2BT2C7DKBS5KN5MFGK3/action/citation_signature","submit_replication":"https://pith.science/pith/VBLXEXR2BT2C7DKBS5KN5MFGK3/action/replication_record"}},"created_at":"2026-07-04T17:18:09.092754+00:00","updated_at":"2026-07-04T17:18:09.092754+00:00"}