{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:J52FVLBVURMX46IJBLYB3RJPCQ","short_pith_number":"pith:J52FVLBV","schema_version":"1.0","canonical_sha256":"4f745aac35a4597e79090af01dc52f141065998030586af7e15adb38a62f8bc8","source":{"kind":"arxiv","id":"1705.10821","version":1},"attestation_state":"computed","paper":{"title":"A Digraph Fourier Transform With Spread Frequency Components","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.SP","authors_text":"Ali Khodabakhsh, Evdokia Nikolova, Gonzalo Mateos, Rasoul Shafipour","submitted_at":"2017-05-30T18:55:14Z","abstract_excerpt":"We study the problem of constructing a graph Fourier transform (GFT) for directed graphs (digraphs), which decomposes graph signals into different modes of variation with respect to the underlying network. Accordingly, to capture low, medium and high frequencies we seek a digraph (D)GFT such that the orthonormal frequency components are as spread as possible in the graph spectral domain. This specification gives rise to a challenging nonconvex optimization problem, so we resort to a simple yet efficient heuristic to construct the DGFT basis from Laplacian eigenvectors of an undirected version "},"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":"1705.10821","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.SP","submitted_at":"2017-05-30T18:55:14Z","cross_cats_sorted":[],"title_canon_sha256":"6e52eba3121d753099bbe016bad282bf6ad0a5e3c799dae4779688ceba02d9d0","abstract_canon_sha256":"0b865666c5b5025475ed278cac2b14360af7bb438ab7e21e3046e30dbb77eebb"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:43:20.143564Z","signature_b64":"sgDsBye2WZ5uoixNCHZX4kybCzqGjrtOT4RD7kKG0EnjQGuRvNDKcLrarXpOSb9YfTDHWaojPjyUsGGTLFYzDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4f745aac35a4597e79090af01dc52f141065998030586af7e15adb38a62f8bc8","last_reissued_at":"2026-05-18T00:43:20.142830Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:43:20.142830Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Digraph Fourier Transform With Spread Frequency Components","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.SP","authors_text":"Ali Khodabakhsh, Evdokia Nikolova, Gonzalo Mateos, Rasoul Shafipour","submitted_at":"2017-05-30T18:55:14Z","abstract_excerpt":"We study the problem of constructing a graph Fourier transform (GFT) for directed graphs (digraphs), which decomposes graph signals into different modes of variation with respect to the underlying network. Accordingly, to capture low, medium and high frequencies we seek a digraph (D)GFT such that the orthonormal frequency components are as spread as possible in the graph spectral domain. This specification gives rise to a challenging nonconvex optimization problem, so we resort to a simple yet efficient heuristic to construct the DGFT basis from Laplacian eigenvectors of an undirected version "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.10821","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":""},"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":"1705.10821","created_at":"2026-05-18T00:43:20.142941+00:00"},{"alias_kind":"arxiv_version","alias_value":"1705.10821v1","created_at":"2026-05-18T00:43:20.142941+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.10821","created_at":"2026-05-18T00:43:20.142941+00:00"},{"alias_kind":"pith_short_12","alias_value":"J52FVLBVURMX","created_at":"2026-05-18T12:31:21.493067+00:00"},{"alias_kind":"pith_short_16","alias_value":"J52FVLBVURMX46IJ","created_at":"2026-05-18T12:31:21.493067+00:00"},{"alias_kind":"pith_short_8","alias_value":"J52FVLBV","created_at":"2026-05-18T12:31:21.493067+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/J52FVLBVURMX46IJBLYB3RJPCQ","json":"https://pith.science/pith/J52FVLBVURMX46IJBLYB3RJPCQ.json","graph_json":"https://pith.science/api/pith-number/J52FVLBVURMX46IJBLYB3RJPCQ/graph.json","events_json":"https://pith.science/api/pith-number/J52FVLBVURMX46IJBLYB3RJPCQ/events.json","paper":"https://pith.science/paper/J52FVLBV"},"agent_actions":{"view_html":"https://pith.science/pith/J52FVLBVURMX46IJBLYB3RJPCQ","download_json":"https://pith.science/pith/J52FVLBVURMX46IJBLYB3RJPCQ.json","view_paper":"https://pith.science/paper/J52FVLBV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1705.10821&json=true","fetch_graph":"https://pith.science/api/pith-number/J52FVLBVURMX46IJBLYB3RJPCQ/graph.json","fetch_events":"https://pith.science/api/pith-number/J52FVLBVURMX46IJBLYB3RJPCQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/J52FVLBVURMX46IJBLYB3RJPCQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/J52FVLBVURMX46IJBLYB3RJPCQ/action/storage_attestation","attest_author":"https://pith.science/pith/J52FVLBVURMX46IJBLYB3RJPCQ/action/author_attestation","sign_citation":"https://pith.science/pith/J52FVLBVURMX46IJBLYB3RJPCQ/action/citation_signature","submit_replication":"https://pith.science/pith/J52FVLBVURMX46IJBLYB3RJPCQ/action/replication_record"}},"created_at":"2026-05-18T00:43:20.142941+00:00","updated_at":"2026-05-18T00:43:20.142941+00:00"}