{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:5H34GDI5SRXRI2IYL2EKVV3U4F","short_pith_number":"pith:5H34GDI5","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"},"canonical_sha256":"e9f7c30d1d946f1469185e88aad774e17a60fda6e32c9dad06372c544761f14b","source":{"kind":"arxiv","id":"2604.24185","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2604.24185","created_at":"2026-06-19T16:11:23Z"},{"alias_kind":"arxiv_version","alias_value":"2604.24185v2","created_at":"2026-06-19T16:11:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2604.24185","created_at":"2026-06-19T16:11:23Z"},{"alias_kind":"pith_short_12","alias_value":"5H34GDI5SRXR","created_at":"2026-06-19T16:11:23Z"},{"alias_kind":"pith_short_16","alias_value":"5H34GDI5SRXRI2IY","created_at":"2026-06-19T16:11:23Z"},{"alias_kind":"pith_short_8","alias_value":"5H34GDI5","created_at":"2026-06-19T16:11:23Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:5H34GDI5SRXRI2IYL2EKVV3U4F","target":"record","payload":{"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"},"canonical_sha256":"e9f7c30d1d946f1469185e88aad774e17a60fda6e32c9dad06372c544761f14b","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"},"source_kind":"arxiv","source_id":"2604.24185","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-06-19T16:11:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sL+M0JsL1NBkCqHyPKowvB/FrmZYfpqTLt+ZNHlCh7FXpfF//3BSlD+mnd1lJUFxNY0y98QXJGMnVMT3TH9HDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-19T23:40:39.223197Z"},"content_sha256":"de91e5807e7fcba95c2dbed3b84634b93d3eb2bbba30da9b3169aeb3c70ef0c8","schema_version":"1.0","event_id":"sha256:de91e5807e7fcba95c2dbed3b84634b93d3eb2bbba30da9b3169aeb3c70ef0c8"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:5H34GDI5SRXRI2IYL2EKVV3U4F","target":"graph","payload":{"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"},"verdict_id":"2ef59eb8-1609-4c7b-b5bc-a914ffaf5e23"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-06-19T16:11:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Y9+vujRn6HAyxyYm/Ic2MPRzHVsJMI8MXpMGxBMaWFRFQARnhB3oZl/akWbNACkMFHo1DYhYarDJJC6drug6AA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-19T23:40:39.223706Z"},"content_sha256":"4a21b09e1812c9b093e06044625f652d377b761540923960cd4884eb7a6cc736","schema_version":"1.0","event_id":"sha256:4a21b09e1812c9b093e06044625f652d377b761540923960cd4884eb7a6cc736"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5H34GDI5SRXRI2IYL2EKVV3U4F/bundle.json","state_url":"https://pith.science/pith/5H34GDI5SRXRI2IYL2EKVV3U4F/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5H34GDI5SRXRI2IYL2EKVV3U4F/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-19T23:40:39Z","links":{"resolver":"https://pith.science/pith/5H34GDI5SRXRI2IYL2EKVV3U4F","bundle":"https://pith.science/pith/5H34GDI5SRXRI2IYL2EKVV3U4F/bundle.json","state":"https://pith.science/pith/5H34GDI5SRXRI2IYL2EKVV3U4F/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5H34GDI5SRXRI2IYL2EKVV3U4F/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:5H34GDI5SRXRI2IYL2EKVV3U4F","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"967453eaddc463da202d8d8c5b17b3de1272c54e04c74d38f2c3a1c631a5792b","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"eess.SP","submitted_at":"2026-04-27T08:46:04Z","title_canon_sha256":"fe3bf97a0f83f775eca71057a44623823288d5e0a5d5b760fa23a4aaabda617c"},"schema_version":"1.0","source":{"id":"2604.24185","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2604.24185","created_at":"2026-06-19T16:11:23Z"},{"alias_kind":"arxiv_version","alias_value":"2604.24185v2","created_at":"2026-06-19T16:11:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2604.24185","created_at":"2026-06-19T16:11:23Z"},{"alias_kind":"pith_short_12","alias_value":"5H34GDI5SRXR","created_at":"2026-06-19T16:11:23Z"},{"alias_kind":"pith_short_16","alias_value":"5H34GDI5SRXRI2IY","created_at":"2026-06-19T16:11:23Z"},{"alias_kind":"pith_short_8","alias_value":"5H34GDI5","created_at":"2026-06-19T16:11:23Z"}],"graph_snapshots":[{"event_id":"sha256:4a21b09e1812c9b093e06044625f652d377b761540923960cd4884eb7a6cc736","target":"graph","created_at":"2026-06-19T16:11:23Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":4,"items":[{"attestation":"unclaimed","claim_id":"C1","kind":"strongest_claim","source":"verdict.strongest_claim","status":"machine_extracted","text":"Numerical experiments confirm that this framework successfully isolates individual sources using solely the observed mixture and the underlying graph topology."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","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."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","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."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"A learnable spectral filtering method separates multiple graph signals from their mixture by restricting each to the low-frequency subspace of its graph."}],"snapshot_sha256":"c30b1383b596d0ec044b134b28ede97a51b74899d5c5df9a4396f640d7213547"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[{"findings_count":0,"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"}],"endpoint":"/pith/2604.24185/integrity.json","findings":[],"snapshot_sha256":"25c77d0006ba599ac981f270ff53865073ce9fcd51d03658b24ff58b6014f268","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Dorina Thanou, Keivan Faghih Niresi, Olga Fink","cross_cats":[],"headline":"A learnable spectral filtering method separates multiple graph signals from their mixture by restricting each to the low-frequency subspace of its graph.","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"eess.SP","submitted_at":"2026-04-27T08:46:04Z","title":"Graph Signal Separation with Learnable Spectral Filters"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2604.24185","kind":"arxiv","version":2},"verdict":{"created_at":"2026-05-08T02:08:00.030874Z","id":"2ef59eb8-1609-4c7b-b5bc-a914ffaf5e23","model_set":{"reader":"grok-4.3"},"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","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.","strongest_claim":"Numerical experiments confirm that this framework successfully isolates individual sources using solely the observed mixture and the underlying graph topology.","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."}},"verdict_id":"2ef59eb8-1609-4c7b-b5bc-a914ffaf5e23"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:de91e5807e7fcba95c2dbed3b84634b93d3eb2bbba30da9b3169aeb3c70ef0c8","target":"record","created_at":"2026-06-19T16:11:23Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"967453eaddc463da202d8d8c5b17b3de1272c54e04c74d38f2c3a1c631a5792b","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"eess.SP","submitted_at":"2026-04-27T08:46:04Z","title_canon_sha256":"fe3bf97a0f83f775eca71057a44623823288d5e0a5d5b760fa23a4aaabda617c"},"schema_version":"1.0","source":{"id":"2604.24185","kind":"arxiv","version":2}},"canonical_sha256":"e9f7c30d1d946f1469185e88aad774e17a60fda6e32c9dad06372c544761f14b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e9f7c30d1d946f1469185e88aad774e17a60fda6e32c9dad06372c544761f14b","first_computed_at":"2026-06-19T16:11:23.897587Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-19T16:11:23.897587Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"1BHrtiorLKQfPHkchUSz3QNj9prBkO5nMsCVmiOIf7Z0kt65qWY0F2663Y9QXFp+oZ9wuP5kCyMf+yQQ64bXBQ==","signature_status":"signed_v1","signed_at":"2026-06-19T16:11:23.898004Z","signed_message":"canonical_sha256_bytes"},"source_id":"2604.24185","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:de91e5807e7fcba95c2dbed3b84634b93d3eb2bbba30da9b3169aeb3c70ef0c8","sha256:4a21b09e1812c9b093e06044625f652d377b761540923960cd4884eb7a6cc736"],"state_sha256":"89516246de1c7ccfa26cc8d674e0f9b4386a179a54b742e37b7d387861eb59b7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oYzUu3p1wj0GBfrnNP23CztJr08cxbX/hbWrfRDUc+CxyITi4Zi2GtZy4yASXLwQrs/T+dgVaLm5Lw1b8S82Dg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-19T23:40:39.226012Z","bundle_sha256":"fe0b7356ad2c81f3f864d959a7b15e2c206d901056d383575c306f12ef35aad0"}}