{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:QYRVCND3DD3TUQRB6RODBKTLQH","short_pith_number":"pith:QYRVCND3","canonical_record":{"source":{"id":"1907.05351","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SP","submitted_at":"2019-07-11T16:19:19Z","cross_cats_sorted":["cs.SD","eess.AS","eess.IV"],"title_canon_sha256":"026d32f45b8387e87acdb48b83bc442751bb0a21fe50f201b319e924453464df","abstract_canon_sha256":"3a1178fd4c7b0fb16b32f50d89f6eeb2e862137a22ae8d2209b255073341caec"},"schema_version":"1.0"},"canonical_sha256":"862351347b18f73a4221f45c30aa6b81c5ab34a2db1f4b076e4171ad466f1aa1","source":{"kind":"arxiv","id":"1907.05351","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1907.05351","created_at":"2026-05-17T23:40:50Z"},{"alias_kind":"arxiv_version","alias_value":"1907.05351v1","created_at":"2026-05-17T23:40:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.05351","created_at":"2026-05-17T23:40:50Z"},{"alias_kind":"pith_short_12","alias_value":"QYRVCND3DD3T","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_16","alias_value":"QYRVCND3DD3TUQRB","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_8","alias_value":"QYRVCND3","created_at":"2026-05-18T12:33:27Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:QYRVCND3DD3TUQRB6RODBKTLQH","target":"record","payload":{"canonical_record":{"source":{"id":"1907.05351","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SP","submitted_at":"2019-07-11T16:19:19Z","cross_cats_sorted":["cs.SD","eess.AS","eess.IV"],"title_canon_sha256":"026d32f45b8387e87acdb48b83bc442751bb0a21fe50f201b319e924453464df","abstract_canon_sha256":"3a1178fd4c7b0fb16b32f50d89f6eeb2e862137a22ae8d2209b255073341caec"},"schema_version":"1.0"},"canonical_sha256":"862351347b18f73a4221f45c30aa6b81c5ab34a2db1f4b076e4171ad466f1aa1","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:40:50.606334Z","signature_b64":"+WDkZc/tSDwBKmeRyV2GQv/ggWPTw1MzJ2NJKW3rkCbE3SH7/Z7fa7kCLlr0gy6FIoAbXGl6FfZL8MslyI9pCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"862351347b18f73a4221f45c30aa6b81c5ab34a2db1f4b076e4171ad466f1aa1","last_reissued_at":"2026-05-17T23:40:50.605625Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:40:50.605625Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1907.05351","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-05-17T23:40:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9r67clcUlzikvCSZCcnzYxbV4eceFQENola4m/f0xEcdlN6kPj/hBDPK7nF5BP4TtSvDU4fwLMpb9Yj3Lf25BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-29T22:51:57.373488Z"},"content_sha256":"de75a4f0ace587ebb9fb6bcac5a15b3d3693f9bde5d859ad8f4c5a4740b7147a","schema_version":"1.0","event_id":"sha256:de75a4f0ace587ebb9fb6bcac5a15b3d3693f9bde5d859ad8f4c5a4740b7147a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:QYRVCND3DD3TUQRB6RODBKTLQH","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Optimized Sharing of Coefficients in Parallel Filter Banks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SD","eess.AS","eess.IV"],"primary_cat":"eess.SP","authors_text":"Erdin\\c{c} L. At{\\i}lgan, M. Tun\\c{c} Arslan, Onur Yorulmaz","submitted_at":"2019-07-11T16:19:19Z","abstract_excerpt":"Filters are the basic and most important blocks of most signal processing applications. In many applications, a group of parallel filters are used as filter banks. Parallel filter banks naturally require much more computations. Especially on chip applications, the resources are limited and shared among many algorithms. For this purpose, many filter optimization schemes are proposed to reduce the number of resources that filtering operations require. In this work, a novel optimization algorithm is proposed to decrease the number of operations in a group of parallel filters. The filter coefficie"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.05351","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"},"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-05-17T23:40:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+kB/fEvmSfyIp/yMbjZ5HEg8+CNz7jX4+vvnc2yFYXx6OEv/oRQTGOKEOeeqcIuW/ir0/Or3qbJCDzIsFhIaDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-29T22:51:57.374229Z"},"content_sha256":"ad87d3a1ff4236860292275e4b5992702e6264117586d9ac1edd0ebc55f829cd","schema_version":"1.0","event_id":"sha256:ad87d3a1ff4236860292275e4b5992702e6264117586d9ac1edd0ebc55f829cd"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QYRVCND3DD3TUQRB6RODBKTLQH/bundle.json","state_url":"https://pith.science/pith/QYRVCND3DD3TUQRB6RODBKTLQH/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QYRVCND3DD3TUQRB6RODBKTLQH/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-05-29T22:51:57Z","links":{"resolver":"https://pith.science/pith/QYRVCND3DD3TUQRB6RODBKTLQH","bundle":"https://pith.science/pith/QYRVCND3DD3TUQRB6RODBKTLQH/bundle.json","state":"https://pith.science/pith/QYRVCND3DD3TUQRB6RODBKTLQH/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QYRVCND3DD3TUQRB6RODBKTLQH/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:QYRVCND3DD3TUQRB6RODBKTLQH","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":"3a1178fd4c7b0fb16b32f50d89f6eeb2e862137a22ae8d2209b255073341caec","cross_cats_sorted":["cs.SD","eess.AS","eess.IV"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SP","submitted_at":"2019-07-11T16:19:19Z","title_canon_sha256":"026d32f45b8387e87acdb48b83bc442751bb0a21fe50f201b319e924453464df"},"schema_version":"1.0","source":{"id":"1907.05351","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1907.05351","created_at":"2026-05-17T23:40:50Z"},{"alias_kind":"arxiv_version","alias_value":"1907.05351v1","created_at":"2026-05-17T23:40:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.05351","created_at":"2026-05-17T23:40:50Z"},{"alias_kind":"pith_short_12","alias_value":"QYRVCND3DD3T","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_16","alias_value":"QYRVCND3DD3TUQRB","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_8","alias_value":"QYRVCND3","created_at":"2026-05-18T12:33:27Z"}],"graph_snapshots":[{"event_id":"sha256:ad87d3a1ff4236860292275e4b5992702e6264117586d9ac1edd0ebc55f829cd","target":"graph","created_at":"2026-05-17T23:40:50Z","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"},"paper":{"abstract_excerpt":"Filters are the basic and most important blocks of most signal processing applications. In many applications, a group of parallel filters are used as filter banks. Parallel filter banks naturally require much more computations. Especially on chip applications, the resources are limited and shared among many algorithms. For this purpose, many filter optimization schemes are proposed to reduce the number of resources that filtering operations require. In this work, a novel optimization algorithm is proposed to decrease the number of operations in a group of parallel filters. The filter coefficie","authors_text":"Erdin\\c{c} L. At{\\i}lgan, M. Tun\\c{c} Arslan, Onur Yorulmaz","cross_cats":["cs.SD","eess.AS","eess.IV"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SP","submitted_at":"2019-07-11T16:19:19Z","title":"Optimized Sharing of Coefficients in Parallel Filter Banks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.05351","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:de75a4f0ace587ebb9fb6bcac5a15b3d3693f9bde5d859ad8f4c5a4740b7147a","target":"record","created_at":"2026-05-17T23:40:50Z","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":"3a1178fd4c7b0fb16b32f50d89f6eeb2e862137a22ae8d2209b255073341caec","cross_cats_sorted":["cs.SD","eess.AS","eess.IV"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SP","submitted_at":"2019-07-11T16:19:19Z","title_canon_sha256":"026d32f45b8387e87acdb48b83bc442751bb0a21fe50f201b319e924453464df"},"schema_version":"1.0","source":{"id":"1907.05351","kind":"arxiv","version":1}},"canonical_sha256":"862351347b18f73a4221f45c30aa6b81c5ab34a2db1f4b076e4171ad466f1aa1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"862351347b18f73a4221f45c30aa6b81c5ab34a2db1f4b076e4171ad466f1aa1","first_computed_at":"2026-05-17T23:40:50.605625Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:40:50.605625Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"+WDkZc/tSDwBKmeRyV2GQv/ggWPTw1MzJ2NJKW3rkCbE3SH7/Z7fa7kCLlr0gy6FIoAbXGl6FfZL8MslyI9pCw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:40:50.606334Z","signed_message":"canonical_sha256_bytes"},"source_id":"1907.05351","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:de75a4f0ace587ebb9fb6bcac5a15b3d3693f9bde5d859ad8f4c5a4740b7147a","sha256:ad87d3a1ff4236860292275e4b5992702e6264117586d9ac1edd0ebc55f829cd"],"state_sha256":"92ee1819426353d627cb85d9d3f51e41cb8aa1b32830c88c3bf82704e295f70e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TUWa9sprEIrSIOjaYEmepHl3VO4u9L88n8YimaO4UJwhBXgmZaiWuW/Rs+piX+nfrv2KYa+Ah9rC9GquCJSDDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-29T22:51:57.377991Z","bundle_sha256":"4a08f1f429d0a7b26d91a6e0c9da822030e6273ff6e59b18bd36f444535b172e"}}