{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:5H34GDI5SRXRI2IYL2EKVV3U4F","short_pith_number":"pith:5H34GDI5","schema_version":"1.0","canonical_sha256":"e9f7c30d1d946f1469185e88aad774e17a60fda6e32c9dad06372c544761f14b","source":{"kind":"arxiv","id":"2604.24185","version":2},"attestation_state":"computed","paper":{"title":"Graph Signal Separation with Learnable Spectral Filters","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"A learnable spectral filtering method separates multiple graph signals from their mixture by restricting each to the low-frequency subspace of its graph.","cross_cats":[],"primary_cat":"eess.SP","authors_text":"Dorina Thanou, Keivan Faghih Niresi, Olga Fink","submitted_at":"2026-04-27T08:46:04Z","abstract_excerpt":"Separating multiple graph signals from a single observed mixture is an inherently ill-posed problem that traditionally relies on restrictive and handcrafted priors. This letter addresses this challenge by proposing an unsupervised learnable spectral filtering framework. Our approach reconstructs latent components by passing a fixed random input through learnable spectral filters, operating within the low-frequency eigenspace of each source-specific graph Laplacian. The architecture implicitly biases the recovered signals toward smooth patterns by confining reconstruction to these low-frequency"},"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":"2604.24185","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"eess.SP","submitted_at":"2026-04-27T08:46:04Z","cross_cats_sorted":[],"title_canon_sha256":"fe3bf97a0f83f775eca71057a44623823288d5e0a5d5b760fa23a4aaabda617c","abstract_canon_sha256":"967453eaddc463da202d8d8c5b17b3de1272c54e04c74d38f2c3a1c631a5792b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-19T16:11:23.898004Z","signature_b64":"1BHrtiorLKQfPHkchUSz3QNj9prBkO5nMsCVmiOIf7Z0kt65qWY0F2663Y9QXFp+oZ9wuP5kCyMf+yQQ64bXBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e9f7c30d1d946f1469185e88aad774e17a60fda6e32c9dad06372c544761f14b","last_reissued_at":"2026-06-19T16:11:23.897587Z","signature_status":"signed_v1","first_computed_at":"2026-06-19T16:11:23.897587Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Graph Signal Separation with Learnable Spectral Filters","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"A learnable spectral filtering method separates multiple graph signals from their mixture by restricting each to the low-frequency subspace of its graph.","cross_cats":[],"primary_cat":"eess.SP","authors_text":"Dorina Thanou, Keivan Faghih Niresi, Olga Fink","submitted_at":"2026-04-27T08:46:04Z","abstract_excerpt":"Separating multiple graph signals from a single observed mixture is an inherently ill-posed problem that traditionally relies on restrictive and handcrafted priors. This letter addresses this challenge by proposing an unsupervised learnable spectral filtering framework. Our approach reconstructs latent components by passing a fixed random input through learnable spectral filters, operating within the low-frequency eigenspace of each source-specific graph Laplacian. The architecture implicitly biases the recovered signals toward smooth patterns by confining reconstruction to these low-frequency"},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"Numerical experiments confirm that this framework successfully isolates individual sources using solely the observed mixture and the underlying graph topology.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"That restricting reconstruction to the low-frequency eigenspace of each source-specific graph Laplacian supplies a sufficiently strong and unique structural prior to separate the latent signals from their mixture, assuming the graphs are known, distinct, and that the signals are indeed smooth on those graphs.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"An unsupervised learnable spectral filtering method separates graph signals from a single mixture by reconstructing each source in its own low-frequency Laplacian subspace.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"A learnable spectral filtering method separates multiple graph signals from their mixture by restricting each to the low-frequency subspace of its graph.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"c30b1383b596d0ec044b134b28ede97a51b74899d5c5df9a4396f640d7213547"},"source":{"id":"2604.24185","kind":"arxiv","version":2},"verdict":{"id":"2ef59eb8-1609-4c7b-b5bc-a914ffaf5e23","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-08T02:08:00.030874Z","strongest_claim":"Numerical experiments confirm that this framework successfully isolates individual sources using solely the observed mixture and the underlying graph topology.","one_line_summary":"An unsupervised learnable spectral filtering method separates graph signals from a single mixture by reconstructing each source in its own low-frequency Laplacian subspace.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"That restricting reconstruction to the low-frequency eigenspace of each source-specific graph Laplacian supplies a sufficiently strong and unique structural prior to separate the latent signals from their mixture, assuming the graphs are known, distinct, and that the signals are indeed smooth on those graphs.","pith_extraction_headline":"A learnable spectral filtering method separates multiple graph signals from their mixture by restricting each to the low-frequency subspace of its graph."},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2604.24185/integrity.json","findings":[],"available":true,"detectors_run":[{"name":"ai_meta_artifact","ran_at":"2026-05-21T07:36:27.009257Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"doi_compliance","ran_at":"2026-05-19T22:23:14.977341Z","status":"completed","version":"1.0.0","findings_count":0}],"snapshot_sha256":"25c77d0006ba599ac981f270ff53865073ce9fcd51d03658b24ff58b6014f268"},"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":"2604.24185","created_at":"2026-06-19T16:11:23.897644+00:00"},{"alias_kind":"arxiv_version","alias_value":"2604.24185v2","created_at":"2026-06-19T16:11:23.897644+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2604.24185","created_at":"2026-06-19T16:11:23.897644+00:00"},{"alias_kind":"pith_short_12","alias_value":"5H34GDI5SRXR","created_at":"2026-06-19T16:11:23.897644+00:00"},{"alias_kind":"pith_short_16","alias_value":"5H34GDI5SRXRI2IY","created_at":"2026-06-19T16:11:23.897644+00:00"},{"alias_kind":"pith_short_8","alias_value":"5H34GDI5","created_at":"2026-06-19T16:11:23.897644+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/5H34GDI5SRXRI2IYL2EKVV3U4F","json":"https://pith.science/pith/5H34GDI5SRXRI2IYL2EKVV3U4F.json","graph_json":"https://pith.science/api/pith-number/5H34GDI5SRXRI2IYL2EKVV3U4F/graph.json","events_json":"https://pith.science/api/pith-number/5H34GDI5SRXRI2IYL2EKVV3U4F/events.json","paper":"https://pith.science/paper/5H34GDI5"},"agent_actions":{"view_html":"https://pith.science/pith/5H34GDI5SRXRI2IYL2EKVV3U4F","download_json":"https://pith.science/pith/5H34GDI5SRXRI2IYL2EKVV3U4F.json","view_paper":"https://pith.science/paper/5H34GDI5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2604.24185&json=true","fetch_graph":"https://pith.science/api/pith-number/5H34GDI5SRXRI2IYL2EKVV3U4F/graph.json","fetch_events":"https://pith.science/api/pith-number/5H34GDI5SRXRI2IYL2EKVV3U4F/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5H34GDI5SRXRI2IYL2EKVV3U4F/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5H34GDI5SRXRI2IYL2EKVV3U4F/action/storage_attestation","attest_author":"https://pith.science/pith/5H34GDI5SRXRI2IYL2EKVV3U4F/action/author_attestation","sign_citation":"https://pith.science/pith/5H34GDI5SRXRI2IYL2EKVV3U4F/action/citation_signature","submit_replication":"https://pith.science/pith/5H34GDI5SRXRI2IYL2EKVV3U4F/action/replication_record"}},"created_at":"2026-06-19T16:11:23.897644+00:00","updated_at":"2026-06-19T16:11:23.897644+00:00"}