{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:Q2CBFOCKGCL7MNQOPT3JC2WHW4","short_pith_number":"pith:Q2CBFOCK","canonical_record":{"source":{"id":"1908.06672","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-08-19T09:57:23Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"319e945c83a5b1c15ba3c98083c3d8c13ab9f2b91f9bfad5d9876591ecaf1a51","abstract_canon_sha256":"b6b25c0a11e6c6f10a65f699025204a49d9e4a1d950a740a4045582112037ac3"},"schema_version":"1.0"},"canonical_sha256":"868412b84a3097f6360e7cf6916ac7b73714ec5843474b73c299589e07fbe4e9","source":{"kind":"arxiv","id":"1908.06672","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1908.06672","created_at":"2026-07-05T00:59:53Z"},{"alias_kind":"arxiv_version","alias_value":"1908.06672v1","created_at":"2026-07-05T00:59:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.06672","created_at":"2026-07-05T00:59:53Z"},{"alias_kind":"pith_short_12","alias_value":"Q2CBFOCKGCL7","created_at":"2026-07-05T00:59:53Z"},{"alias_kind":"pith_short_16","alias_value":"Q2CBFOCKGCL7MNQO","created_at":"2026-07-05T00:59:53Z"},{"alias_kind":"pith_short_8","alias_value":"Q2CBFOCK","created_at":"2026-07-05T00:59:53Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:Q2CBFOCKGCL7MNQOPT3JC2WHW4","target":"record","payload":{"canonical_record":{"source":{"id":"1908.06672","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-08-19T09:57:23Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"319e945c83a5b1c15ba3c98083c3d8c13ab9f2b91f9bfad5d9876591ecaf1a51","abstract_canon_sha256":"b6b25c0a11e6c6f10a65f699025204a49d9e4a1d950a740a4045582112037ac3"},"schema_version":"1.0"},"canonical_sha256":"868412b84a3097f6360e7cf6916ac7b73714ec5843474b73c299589e07fbe4e9","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:59:53.669759Z","signature_b64":"1CFwYYZO6SJXVgBGLCpntfWO6ylLkoG9HKvqIys6OPn6q1//k0rLIbXLKl9KNOC/4dnWpuTSHbNUDStIpZWlBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"868412b84a3097f6360e7cf6916ac7b73714ec5843474b73c299589e07fbe4e9","last_reissued_at":"2026-07-05T00:59:53.669332Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:59:53.669332Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1908.06672","source_version":1,"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-07-05T00:59:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UvWaKO2n/zfZIPRP2wpeBhugc196Rs3M429h1jO9Jp+zmxlHu5b7s7pPIFEsrCR+kohejSBzCPSsauVfvwCoAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-16T05:27:05.045538Z"},"content_sha256":"90694cbde70d32be1e9200384b035afcdf0112935e525f29c7d21ded0c634bdc","schema_version":"1.0","event_id":"sha256:90694cbde70d32be1e9200384b035afcdf0112935e525f29c7d21ded0c634bdc"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:Q2CBFOCKGCL7MNQOPT3JC2WHW4","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Graph Fourier Transform Based on $\\ell_1$ Norm Variation Minimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Anna Qi, Chao Huang, Jianfeng Huang, Lihua Yang","submitted_at":"2019-08-19T09:57:23Z","abstract_excerpt":"The definition of the graph Fourier transform is a fundamental issue in graph signal processing. Conventional graph Fourier transform is defined through the eigenvectors of the graph Laplacian matrix, which minimize the $\\ell_2$ norm signal variation. However, the computation of Laplacian eigenvectors is expensive when the graph is large. In this paper, we propose an alternative definition of graph Fourier transform based on the $\\ell_1$ norm variation minimization. We obtain a necessary condition satisfied by the $\\ell_1$ Fourier basis, and provide a fast greedy algorithm to approximate the $"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1908.06672","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/1908.06672/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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T00:59:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"30ugrEBKELsVxpKtz/o3igN7nJ/eMN2xjXLsDpoS2Aax4CX+pf5HlZAPJEDvHmwIFoPLuC8B8xjizC/Bxu8KCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-16T05:27:05.046091Z"},"content_sha256":"97aa5af77d24780c8e9406b70ea2b3a414717b2ff73080abb7a6291d757ed099","schema_version":"1.0","event_id":"sha256:97aa5af77d24780c8e9406b70ea2b3a414717b2ff73080abb7a6291d757ed099"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/Q2CBFOCKGCL7MNQOPT3JC2WHW4/bundle.json","state_url":"https://pith.science/pith/Q2CBFOCKGCL7MNQOPT3JC2WHW4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/Q2CBFOCKGCL7MNQOPT3JC2WHW4/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-08-16T05:27:05Z","links":{"resolver":"https://pith.science/pith/Q2CBFOCKGCL7MNQOPT3JC2WHW4","bundle":"https://pith.science/pith/Q2CBFOCKGCL7MNQOPT3JC2WHW4/bundle.json","state":"https://pith.science/pith/Q2CBFOCKGCL7MNQOPT3JC2WHW4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/Q2CBFOCKGCL7MNQOPT3JC2WHW4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:Q2CBFOCKGCL7MNQOPT3JC2WHW4","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":"b6b25c0a11e6c6f10a65f699025204a49d9e4a1d950a740a4045582112037ac3","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-08-19T09:57:23Z","title_canon_sha256":"319e945c83a5b1c15ba3c98083c3d8c13ab9f2b91f9bfad5d9876591ecaf1a51"},"schema_version":"1.0","source":{"id":"1908.06672","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1908.06672","created_at":"2026-07-05T00:59:53Z"},{"alias_kind":"arxiv_version","alias_value":"1908.06672v1","created_at":"2026-07-05T00:59:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.06672","created_at":"2026-07-05T00:59:53Z"},{"alias_kind":"pith_short_12","alias_value":"Q2CBFOCKGCL7","created_at":"2026-07-05T00:59:53Z"},{"alias_kind":"pith_short_16","alias_value":"Q2CBFOCKGCL7MNQO","created_at":"2026-07-05T00:59:53Z"},{"alias_kind":"pith_short_8","alias_value":"Q2CBFOCK","created_at":"2026-07-05T00:59:53Z"}],"graph_snapshots":[{"event_id":"sha256:97aa5af77d24780c8e9406b70ea2b3a414717b2ff73080abb7a6291d757ed099","target":"graph","created_at":"2026-07-05T00:59:53Z","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":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/1908.06672/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"The definition of the graph Fourier transform is a fundamental issue in graph signal processing. Conventional graph Fourier transform is defined through the eigenvectors of the graph Laplacian matrix, which minimize the $\\ell_2$ norm signal variation. However, the computation of Laplacian eigenvectors is expensive when the graph is large. In this paper, we propose an alternative definition of graph Fourier transform based on the $\\ell_1$ norm variation minimization. We obtain a necessary condition satisfied by the $\\ell_1$ Fourier basis, and provide a fast greedy algorithm to approximate the $","authors_text":"Anna Qi, Chao Huang, Jianfeng Huang, Lihua Yang","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-08-19T09:57:23Z","title":"Graph Fourier Transform Based on $\\ell_1$ Norm Variation Minimization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1908.06672","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:90694cbde70d32be1e9200384b035afcdf0112935e525f29c7d21ded0c634bdc","target":"record","created_at":"2026-07-05T00:59:53Z","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":"b6b25c0a11e6c6f10a65f699025204a49d9e4a1d950a740a4045582112037ac3","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-08-19T09:57:23Z","title_canon_sha256":"319e945c83a5b1c15ba3c98083c3d8c13ab9f2b91f9bfad5d9876591ecaf1a51"},"schema_version":"1.0","source":{"id":"1908.06672","kind":"arxiv","version":1}},"canonical_sha256":"868412b84a3097f6360e7cf6916ac7b73714ec5843474b73c299589e07fbe4e9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"868412b84a3097f6360e7cf6916ac7b73714ec5843474b73c299589e07fbe4e9","first_computed_at":"2026-07-05T00:59:53.669332Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T00:59:53.669332Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"1CFwYYZO6SJXVgBGLCpntfWO6ylLkoG9HKvqIys6OPn6q1//k0rLIbXLKl9KNOC/4dnWpuTSHbNUDStIpZWlBA==","signature_status":"signed_v1","signed_at":"2026-07-05T00:59:53.669759Z","signed_message":"canonical_sha256_bytes"},"source_id":"1908.06672","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:90694cbde70d32be1e9200384b035afcdf0112935e525f29c7d21ded0c634bdc","sha256:97aa5af77d24780c8e9406b70ea2b3a414717b2ff73080abb7a6291d757ed099"],"state_sha256":"b9a2e26cdfb52bc5c02f699634182c110e2b398f49e50cd0fc9cfbad45cf24fd"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bCjvSSTucVZtBQfNIvxouaHpdQaINFVx7XT94cDllp7uZuAthIQLLlJJXdolCzFDawFp+X6NvNQbiUVXcQ/OAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-16T05:27:05.050265Z","bundle_sha256":"cf1dda40987f6976417cedacdde9c9ffd81bfb2d3296b675b60085511d47081d"}}