{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:KNSPQBWR5TGUISAC4E7EU322LE","short_pith_number":"pith:KNSPQBWR","schema_version":"1.0","canonical_sha256":"5364f806d1eccd444802e13e4a6f5a590e633abd61e982eaa5af29c49f85f046","source":{"kind":"arxiv","id":"2301.03496","version":1},"attestation_state":"computed","paper":{"title":"Time-Varying Graph Mode Decomposition","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"eess.SP","authors_text":"Naveed ur Rehman","submitted_at":"2023-01-09T16:36:43Z","abstract_excerpt":"Time-varying graph signals are alternative representation of multivariate (or multichannel) signals in which a single time-series is associated with each of the nodes or vertex of a graph. Aided by the graph-theoretic tools, time-varying graph models have the ability to capture the underlying structure of the data associated with multiple nodes of a graph -- a feat that is hard to accomplish using standard signal processing approaches. The aim of this contribution is to propose a method for the decomposition of time-varying graph signals into a set of graph modes. The graph modes can be interp"},"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":"2301.03496","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"eess.SP","submitted_at":"2023-01-09T16:36:43Z","cross_cats_sorted":[],"title_canon_sha256":"32c0215db38164fb906a225058d98419785fbc0c9076ee88afd42eacd74df1ee","abstract_canon_sha256":"b82062e3b53c5bf387ea84def5c6ea8032572a33c2586e3f57da455473172e3b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:31:36.419309Z","signature_b64":"XeDNHlI64urKtHwgW5GLdrCaeWmRbHe2vYHcFm2Pu7yaZOJj7kVHmO4Xlud42krLgxuPvsDqp2iHNjMgw4+SBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5364f806d1eccd444802e13e4a6f5a590e633abd61e982eaa5af29c49f85f046","last_reissued_at":"2026-07-05T05:31:36.418954Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:31:36.418954Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Time-Varying Graph Mode Decomposition","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"eess.SP","authors_text":"Naveed ur Rehman","submitted_at":"2023-01-09T16:36:43Z","abstract_excerpt":"Time-varying graph signals are alternative representation of multivariate (or multichannel) signals in which a single time-series is associated with each of the nodes or vertex of a graph. Aided by the graph-theoretic tools, time-varying graph models have the ability to capture the underlying structure of the data associated with multiple nodes of a graph -- a feat that is hard to accomplish using standard signal processing approaches. The aim of this contribution is to propose a method for the decomposition of time-varying graph signals into a set of graph modes. The graph modes can be interp"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2301.03496","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/2301.03496/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":"2301.03496","created_at":"2026-07-05T05:31:36.419010+00:00"},{"alias_kind":"arxiv_version","alias_value":"2301.03496v1","created_at":"2026-07-05T05:31:36.419010+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2301.03496","created_at":"2026-07-05T05:31:36.419010+00:00"},{"alias_kind":"pith_short_12","alias_value":"KNSPQBWR5TGU","created_at":"2026-07-05T05:31:36.419010+00:00"},{"alias_kind":"pith_short_16","alias_value":"KNSPQBWR5TGUISAC","created_at":"2026-07-05T05:31:36.419010+00:00"},{"alias_kind":"pith_short_8","alias_value":"KNSPQBWR","created_at":"2026-07-05T05:31:36.419010+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/KNSPQBWR5TGUISAC4E7EU322LE","json":"https://pith.science/pith/KNSPQBWR5TGUISAC4E7EU322LE.json","graph_json":"https://pith.science/api/pith-number/KNSPQBWR5TGUISAC4E7EU322LE/graph.json","events_json":"https://pith.science/api/pith-number/KNSPQBWR5TGUISAC4E7EU322LE/events.json","paper":"https://pith.science/paper/KNSPQBWR"},"agent_actions":{"view_html":"https://pith.science/pith/KNSPQBWR5TGUISAC4E7EU322LE","download_json":"https://pith.science/pith/KNSPQBWR5TGUISAC4E7EU322LE.json","view_paper":"https://pith.science/paper/KNSPQBWR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2301.03496&json=true","fetch_graph":"https://pith.science/api/pith-number/KNSPQBWR5TGUISAC4E7EU322LE/graph.json","fetch_events":"https://pith.science/api/pith-number/KNSPQBWR5TGUISAC4E7EU322LE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KNSPQBWR5TGUISAC4E7EU322LE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KNSPQBWR5TGUISAC4E7EU322LE/action/storage_attestation","attest_author":"https://pith.science/pith/KNSPQBWR5TGUISAC4E7EU322LE/action/author_attestation","sign_citation":"https://pith.science/pith/KNSPQBWR5TGUISAC4E7EU322LE/action/citation_signature","submit_replication":"https://pith.science/pith/KNSPQBWR5TGUISAC4E7EU322LE/action/replication_record"}},"created_at":"2026-07-05T05:31:36.419010+00:00","updated_at":"2026-07-05T05:31:36.419010+00:00"}