{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:N67GFYRT56B2OKM5HJJBBHKZJG","short_pith_number":"pith:N67GFYRT","canonical_record":{"source":{"id":"1711.04907","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2017-11-14T02:07:02Z","cross_cats_sorted":[],"title_canon_sha256":"32b2d908b5826435c8ca59ec5ba3d48a312d2310526093a7bd468be8c8101395","abstract_canon_sha256":"afff8488ccd8387c98a1bbffc7e7a429f3de8fa1705abb745024899d6544a4c5"},"schema_version":"1.0"},"canonical_sha256":"6fbe62e233ef83a7299d3a52109d5949a6b855b7473d0d6baf07fac8454d8802","source":{"kind":"arxiv","id":"1711.04907","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1711.04907","created_at":"2026-05-18T00:25:33Z"},{"alias_kind":"arxiv_version","alias_value":"1711.04907v2","created_at":"2026-05-18T00:25:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.04907","created_at":"2026-05-18T00:25:33Z"},{"alias_kind":"pith_short_12","alias_value":"N67GFYRT56B2","created_at":"2026-05-18T12:31:31Z"},{"alias_kind":"pith_short_16","alias_value":"N67GFYRT56B2OKM5","created_at":"2026-05-18T12:31:31Z"},{"alias_kind":"pith_short_8","alias_value":"N67GFYRT","created_at":"2026-05-18T12:31:31Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:N67GFYRT56B2OKM5HJJBBHKZJG","target":"record","payload":{"canonical_record":{"source":{"id":"1711.04907","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2017-11-14T02:07:02Z","cross_cats_sorted":[],"title_canon_sha256":"32b2d908b5826435c8ca59ec5ba3d48a312d2310526093a7bd468be8c8101395","abstract_canon_sha256":"afff8488ccd8387c98a1bbffc7e7a429f3de8fa1705abb745024899d6544a4c5"},"schema_version":"1.0"},"canonical_sha256":"6fbe62e233ef83a7299d3a52109d5949a6b855b7473d0d6baf07fac8454d8802","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:25:33.537185Z","signature_b64":"hmkB7e3IWp3JqLd1yruQ32xdLeqKx9COH8Ik5FowYYX25yos4p0UCiaijfhEtmP/3sfBUDVBiayRQVxq3a1PAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6fbe62e233ef83a7299d3a52109d5949a6b855b7473d0d6baf07fac8454d8802","last_reissued_at":"2026-05-18T00:25:33.536569Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:25:33.536569Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1711.04907","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-05-18T00:25:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HviLR1x5IRcAV8vN81q7MIeLQJ6AiE1UMSecPf3BdAPIgnDMtJH3ZePzVp3Bd5i2SyNQQxj5VUne6aMXdJiTAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T22:40:16.339289Z"},"content_sha256":"7645c54241ba3fd45381f26b0da930b57c3e7256b7b23cee5df905a3aaa7ed34","schema_version":"1.0","event_id":"sha256:7645c54241ba3fd45381f26b0da930b57c3e7256b7b23cee5df905a3aaa7ed34"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:N67GFYRT56B2OKM5HJJBBHKZJG","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Family of Constrained Adaptive filtering Algorithms Based on Logarithmic Cost","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.SY","authors_text":"Subrahmanyam Mula, Vinay Chakravarthi Gogineni","submitted_at":"2017-11-14T02:07:02Z","abstract_excerpt":"This paper introduces a novel constraint adaptive filtering algorithm based on a relative logarithmic cost function which is termed as Constrained Least Mean Logarithmic Square (CLMLS). The proposed CLMLS algorithm elegantly adjusts the cost function based on the amount of error thereby achieves better performance compared to the conventional Constrained LMS (CLMS) algorithm. With no assumption on input, the mean square stability analysis of the proposed CLMLS algorithm is presented using the energy conservation approach. The analytical expressions for the transient and steady state MSD are de"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.04907","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"},"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-18T00:25:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qqHSdu8QQzeBBgewj0JenOdzK2hbYQAX53Bc7L1zER131iI2dCfZUDALtitJEADJsdw6O4qB3TXJl5Cxce9YCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T22:40:16.339997Z"},"content_sha256":"f1260e409f9705449da66518a4e29f6eaa67d03c7fd47e8fe105fb955a33c83a","schema_version":"1.0","event_id":"sha256:f1260e409f9705449da66518a4e29f6eaa67d03c7fd47e8fe105fb955a33c83a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/N67GFYRT56B2OKM5HJJBBHKZJG/bundle.json","state_url":"https://pith.science/pith/N67GFYRT56B2OKM5HJJBBHKZJG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/N67GFYRT56B2OKM5HJJBBHKZJG/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-31T22:40:16Z","links":{"resolver":"https://pith.science/pith/N67GFYRT56B2OKM5HJJBBHKZJG","bundle":"https://pith.science/pith/N67GFYRT56B2OKM5HJJBBHKZJG/bundle.json","state":"https://pith.science/pith/N67GFYRT56B2OKM5HJJBBHKZJG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/N67GFYRT56B2OKM5HJJBBHKZJG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:N67GFYRT56B2OKM5HJJBBHKZJG","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":"afff8488ccd8387c98a1bbffc7e7a429f3de8fa1705abb745024899d6544a4c5","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2017-11-14T02:07:02Z","title_canon_sha256":"32b2d908b5826435c8ca59ec5ba3d48a312d2310526093a7bd468be8c8101395"},"schema_version":"1.0","source":{"id":"1711.04907","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1711.04907","created_at":"2026-05-18T00:25:33Z"},{"alias_kind":"arxiv_version","alias_value":"1711.04907v2","created_at":"2026-05-18T00:25:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.04907","created_at":"2026-05-18T00:25:33Z"},{"alias_kind":"pith_short_12","alias_value":"N67GFYRT56B2","created_at":"2026-05-18T12:31:31Z"},{"alias_kind":"pith_short_16","alias_value":"N67GFYRT56B2OKM5","created_at":"2026-05-18T12:31:31Z"},{"alias_kind":"pith_short_8","alias_value":"N67GFYRT","created_at":"2026-05-18T12:31:31Z"}],"graph_snapshots":[{"event_id":"sha256:f1260e409f9705449da66518a4e29f6eaa67d03c7fd47e8fe105fb955a33c83a","target":"graph","created_at":"2026-05-18T00:25:33Z","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":"This paper introduces a novel constraint adaptive filtering algorithm based on a relative logarithmic cost function which is termed as Constrained Least Mean Logarithmic Square (CLMLS). The proposed CLMLS algorithm elegantly adjusts the cost function based on the amount of error thereby achieves better performance compared to the conventional Constrained LMS (CLMS) algorithm. With no assumption on input, the mean square stability analysis of the proposed CLMLS algorithm is presented using the energy conservation approach. The analytical expressions for the transient and steady state MSD are de","authors_text":"Subrahmanyam Mula, Vinay Chakravarthi Gogineni","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2017-11-14T02:07:02Z","title":"A Family of Constrained Adaptive filtering Algorithms Based on Logarithmic Cost"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.04907","kind":"arxiv","version":2},"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:7645c54241ba3fd45381f26b0da930b57c3e7256b7b23cee5df905a3aaa7ed34","target":"record","created_at":"2026-05-18T00:25:33Z","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":"afff8488ccd8387c98a1bbffc7e7a429f3de8fa1705abb745024899d6544a4c5","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2017-11-14T02:07:02Z","title_canon_sha256":"32b2d908b5826435c8ca59ec5ba3d48a312d2310526093a7bd468be8c8101395"},"schema_version":"1.0","source":{"id":"1711.04907","kind":"arxiv","version":2}},"canonical_sha256":"6fbe62e233ef83a7299d3a52109d5949a6b855b7473d0d6baf07fac8454d8802","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6fbe62e233ef83a7299d3a52109d5949a6b855b7473d0d6baf07fac8454d8802","first_computed_at":"2026-05-18T00:25:33.536569Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:25:33.536569Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"hmkB7e3IWp3JqLd1yruQ32xdLeqKx9COH8Ik5FowYYX25yos4p0UCiaijfhEtmP/3sfBUDVBiayRQVxq3a1PAw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:25:33.537185Z","signed_message":"canonical_sha256_bytes"},"source_id":"1711.04907","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7645c54241ba3fd45381f26b0da930b57c3e7256b7b23cee5df905a3aaa7ed34","sha256:f1260e409f9705449da66518a4e29f6eaa67d03c7fd47e8fe105fb955a33c83a"],"state_sha256":"da8c4106ed8ef2b85dd00c5024a98c0b0aa5c9ee3a5f953c42e9e010fdc0f1bd"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JV6XY7zqeC3P4w12B4+B4ay70hZ8dEb8aizJFF/i3dv8iYYcv+xfTHQP4bCJsq93e73AyVFuP3Fj/r7SqqR8AA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T22:40:16.343922Z","bundle_sha256":"7107401a552d1508601a0520f8280e0b387cbf5fe5f781e74740b096928dfca3"}}