{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:S3GTIVIPB4JWU3T4ZBFBNQ3VBH","short_pith_number":"pith:S3GTIVIP","schema_version":"1.0","canonical_sha256":"96cd34550f0f136a6e7cc84a16c37509c960d2208e6ae10b66bf8d49d16bb38c","source":{"kind":"arxiv","id":"2606.24011","version":1},"attestation_state":"computed","paper":{"title":"Low-rank Updates in Slowly Time-varying Graphs for Spatial-Temporal Signal Interpolation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"eess.SP","authors_text":"Antonio Ortega, Gene Cheung, Saghar Bagheri, Tim Eadie","submitted_at":"2026-06-22T23:33:33Z","abstract_excerpt":"A crucial assumption in graph signal processing (GSP) is the existence of an underlying graph that captures the pairwise similarities between nodes, allowing filters to be designed based on this graph for tasks such as denoising. For spatial-temporal data in which node-to-node similarities evolve over time, a static spatial graph is insufficient. In this paper, to represent slowly time-varying pairwise relationships, we model the graph changes in two consecutive adjacency matrices $P = W^{(2)} - W^{(1)}$ across time as a low-rank matrix. % Specifically, given an initial adjacency matrix $W^{(1"},"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":"2606.24011","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SP","submitted_at":"2026-06-22T23:33:33Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"11376db478f6b93edd778f2076a1a5b6261fa6cc71fb81406368fb2207e91e4f","abstract_canon_sha256":"f6c6e97bc0885d93d2664a0590757e128f6d915d5a343716033595b992fbbf0c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-24T01:14:38.104340Z","signature_b64":"6b9IbXC5T6j4JO0aQr2B6pE5jXX4t9sLFJ/EYP8LzPmyiHeuzPF5smhOQOV9uwpJrIsnhHpny59+kGVJKhy8BQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"96cd34550f0f136a6e7cc84a16c37509c960d2208e6ae10b66bf8d49d16bb38c","last_reissued_at":"2026-06-24T01:14:38.103787Z","signature_status":"signed_v1","first_computed_at":"2026-06-24T01:14:38.103787Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Low-rank Updates in Slowly Time-varying Graphs for Spatial-Temporal Signal Interpolation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"eess.SP","authors_text":"Antonio Ortega, Gene Cheung, Saghar Bagheri, Tim Eadie","submitted_at":"2026-06-22T23:33:33Z","abstract_excerpt":"A crucial assumption in graph signal processing (GSP) is the existence of an underlying graph that captures the pairwise similarities between nodes, allowing filters to be designed based on this graph for tasks such as denoising. For spatial-temporal data in which node-to-node similarities evolve over time, a static spatial graph is insufficient. In this paper, to represent slowly time-varying pairwise relationships, we model the graph changes in two consecutive adjacency matrices $P = W^{(2)} - W^{(1)}$ across time as a low-rank matrix. % Specifically, given an initial adjacency matrix $W^{(1"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.24011","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/2606.24011/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":"2606.24011","created_at":"2026-06-24T01:14:38.103855+00:00"},{"alias_kind":"arxiv_version","alias_value":"2606.24011v1","created_at":"2026-06-24T01:14:38.103855+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.24011","created_at":"2026-06-24T01:14:38.103855+00:00"},{"alias_kind":"pith_short_12","alias_value":"S3GTIVIPB4JW","created_at":"2026-06-24T01:14:38.103855+00:00"},{"alias_kind":"pith_short_16","alias_value":"S3GTIVIPB4JWU3T4","created_at":"2026-06-24T01:14:38.103855+00:00"},{"alias_kind":"pith_short_8","alias_value":"S3GTIVIP","created_at":"2026-06-24T01:14:38.103855+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/S3GTIVIPB4JWU3T4ZBFBNQ3VBH","json":"https://pith.science/pith/S3GTIVIPB4JWU3T4ZBFBNQ3VBH.json","graph_json":"https://pith.science/api/pith-number/S3GTIVIPB4JWU3T4ZBFBNQ3VBH/graph.json","events_json":"https://pith.science/api/pith-number/S3GTIVIPB4JWU3T4ZBFBNQ3VBH/events.json","paper":"https://pith.science/paper/S3GTIVIP"},"agent_actions":{"view_html":"https://pith.science/pith/S3GTIVIPB4JWU3T4ZBFBNQ3VBH","download_json":"https://pith.science/pith/S3GTIVIPB4JWU3T4ZBFBNQ3VBH.json","view_paper":"https://pith.science/paper/S3GTIVIP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2606.24011&json=true","fetch_graph":"https://pith.science/api/pith-number/S3GTIVIPB4JWU3T4ZBFBNQ3VBH/graph.json","fetch_events":"https://pith.science/api/pith-number/S3GTIVIPB4JWU3T4ZBFBNQ3VBH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/S3GTIVIPB4JWU3T4ZBFBNQ3VBH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/S3GTIVIPB4JWU3T4ZBFBNQ3VBH/action/storage_attestation","attest_author":"https://pith.science/pith/S3GTIVIPB4JWU3T4ZBFBNQ3VBH/action/author_attestation","sign_citation":"https://pith.science/pith/S3GTIVIPB4JWU3T4ZBFBNQ3VBH/action/citation_signature","submit_replication":"https://pith.science/pith/S3GTIVIPB4JWU3T4ZBFBNQ3VBH/action/replication_record"}},"created_at":"2026-06-24T01:14:38.103855+00:00","updated_at":"2026-06-24T01:14:38.103855+00:00"}