{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:D6KKYYLYNZNFYJVVU7VHMM65FS","short_pith_number":"pith:D6KKYYLY","schema_version":"1.0","canonical_sha256":"1f94ac61786e5a5c26b5a7ea7633dd2c9534b85d0bb4a4c4ccf890ffa026f99a","source":{"kind":"arxiv","id":"1710.10450","version":2},"attestation_state":"computed","paper":{"title":"Shift-enabled graphs: Graphs where shift-invariant filters are representable as polynomials of shift operations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"eess.SP","authors_text":"Lina Stankovic, Liyan Chen, Samuel Cheng, Vlandimir Stankovic","submitted_at":"2017-10-28T11:52:10Z","abstract_excerpt":"In digital signal processing, shift-invariant filters can be represented as a polynomial expansion of a shift operation,that is, the Z-transform representation. When extended to graph signal processing (GSP), this would mean that a shift-invariant graph filter can be represented as a polynomial of the adjacency (shift) matrix of the graph. However, the characteristic and minimum polynomials of the adjacency matrix must be identical for the property to hold. While it has been suggested that this condition might be ignored as it is always possible to find a polynomial transform to represent the "},"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":"1710.10450","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SP","submitted_at":"2017-10-28T11:52:10Z","cross_cats_sorted":[],"title_canon_sha256":"cbc49c3dc70328f03f07eb14242088b92044ebf1969d7a9051c53b8e81099a8c","abstract_canon_sha256":"fc4039455d37479593819ca97b0e4e4d52aae3ed7acfd014cbf16888f7e3395b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:08:10.987136Z","signature_b64":"1E9qU4FrveWxr7YNPxYTk+bxz8lI6m+u5sF5zipIzOu0rrpNwrTaVDzL5HDVZVG5vzZ0PkV3PqxUsz1D/pWODA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1f94ac61786e5a5c26b5a7ea7633dd2c9534b85d0bb4a4c4ccf890ffa026f99a","last_reissued_at":"2026-05-18T00:08:10.986491Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:08:10.986491Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Shift-enabled graphs: Graphs where shift-invariant filters are representable as polynomials of shift operations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"eess.SP","authors_text":"Lina Stankovic, Liyan Chen, Samuel Cheng, Vlandimir Stankovic","submitted_at":"2017-10-28T11:52:10Z","abstract_excerpt":"In digital signal processing, shift-invariant filters can be represented as a polynomial expansion of a shift operation,that is, the Z-transform representation. When extended to graph signal processing (GSP), this would mean that a shift-invariant graph filter can be represented as a polynomial of the adjacency (shift) matrix of the graph. However, the characteristic and minimum polynomials of the adjacency matrix must be identical for the property to hold. While it has been suggested that this condition might be ignored as it is always possible to find a polynomial transform to represent the "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.10450","kind":"arxiv","version":2},"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":"1710.10450","created_at":"2026-05-18T00:08:10.986598+00:00"},{"alias_kind":"arxiv_version","alias_value":"1710.10450v2","created_at":"2026-05-18T00:08:10.986598+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.10450","created_at":"2026-05-18T00:08:10.986598+00:00"},{"alias_kind":"pith_short_12","alias_value":"D6KKYYLYNZNF","created_at":"2026-05-18T12:31:10.602751+00:00"},{"alias_kind":"pith_short_16","alias_value":"D6KKYYLYNZNFYJVV","created_at":"2026-05-18T12:31:10.602751+00:00"},{"alias_kind":"pith_short_8","alias_value":"D6KKYYLY","created_at":"2026-05-18T12:31:10.602751+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/D6KKYYLYNZNFYJVVU7VHMM65FS","json":"https://pith.science/pith/D6KKYYLYNZNFYJVVU7VHMM65FS.json","graph_json":"https://pith.science/api/pith-number/D6KKYYLYNZNFYJVVU7VHMM65FS/graph.json","events_json":"https://pith.science/api/pith-number/D6KKYYLYNZNFYJVVU7VHMM65FS/events.json","paper":"https://pith.science/paper/D6KKYYLY"},"agent_actions":{"view_html":"https://pith.science/pith/D6KKYYLYNZNFYJVVU7VHMM65FS","download_json":"https://pith.science/pith/D6KKYYLYNZNFYJVVU7VHMM65FS.json","view_paper":"https://pith.science/paper/D6KKYYLY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1710.10450&json=true","fetch_graph":"https://pith.science/api/pith-number/D6KKYYLYNZNFYJVVU7VHMM65FS/graph.json","fetch_events":"https://pith.science/api/pith-number/D6KKYYLYNZNFYJVVU7VHMM65FS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/D6KKYYLYNZNFYJVVU7VHMM65FS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/D6KKYYLYNZNFYJVVU7VHMM65FS/action/storage_attestation","attest_author":"https://pith.science/pith/D6KKYYLYNZNFYJVVU7VHMM65FS/action/author_attestation","sign_citation":"https://pith.science/pith/D6KKYYLYNZNFYJVVU7VHMM65FS/action/citation_signature","submit_replication":"https://pith.science/pith/D6KKYYLYNZNFYJVVU7VHMM65FS/action/replication_record"}},"created_at":"2026-05-18T00:08:10.986598+00:00","updated_at":"2026-05-18T00:08:10.986598+00:00"}