{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:4EF4NOTC3OPAZ2AYJQTUWHGSGD","short_pith_number":"pith:4EF4NOTC","canonical_record":{"source":{"id":"1311.6809","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2013-11-26T10:02:20Z","cross_cats_sorted":[],"title_canon_sha256":"f181fca123ba6b7476827908d49945acb82e6a7a19d38e477401c2ece0d65722","abstract_canon_sha256":"2cf9bd60d5a80252ebb0c928298921d18091209de8c54db62a26da1b51e5dfd1"},"schema_version":"1.0"},"canonical_sha256":"e10bc6ba62db9e0ce8184c274b1cd230de16053845e6883bce6ba48baa1d19f1","source":{"kind":"arxiv","id":"1311.6809","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1311.6809","created_at":"2026-05-18T01:46:05Z"},{"alias_kind":"arxiv_version","alias_value":"1311.6809v1","created_at":"2026-05-18T01:46:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1311.6809","created_at":"2026-05-18T01:46:05Z"},{"alias_kind":"pith_short_12","alias_value":"4EF4NOTC3OPA","created_at":"2026-05-18T12:27:32Z"},{"alias_kind":"pith_short_16","alias_value":"4EF4NOTC3OPAZ2AY","created_at":"2026-05-18T12:27:32Z"},{"alias_kind":"pith_short_8","alias_value":"4EF4NOTC","created_at":"2026-05-18T12:27:32Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:4EF4NOTC3OPAZ2AYJQTUWHGSGD","target":"record","payload":{"canonical_record":{"source":{"id":"1311.6809","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2013-11-26T10:02:20Z","cross_cats_sorted":[],"title_canon_sha256":"f181fca123ba6b7476827908d49945acb82e6a7a19d38e477401c2ece0d65722","abstract_canon_sha256":"2cf9bd60d5a80252ebb0c928298921d18091209de8c54db62a26da1b51e5dfd1"},"schema_version":"1.0"},"canonical_sha256":"e10bc6ba62db9e0ce8184c274b1cd230de16053845e6883bce6ba48baa1d19f1","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:46:05.921121Z","signature_b64":"ryP7ykt97YKoz8APMeCRalOSLfLEhfSmK0ruMas9Q7ZOTQ3gYbn8aOq/XaK/PbnWhr7gQWIUQXcuNK6QpEotDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e10bc6ba62db9e0ce8184c274b1cd230de16053845e6883bce6ba48baa1d19f1","last_reissued_at":"2026-05-18T01:46:05.920676Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:46:05.920676Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1311.6809","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-18T01:46:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"21R+xMCwUYH8g/qEmulGeKgRdlcQWAkda/WTbsWnG47brdAVfpsWI8W/nHPckWzzTbVyYXqbZ0IKMKYi0741Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-26T01:01:42.505007Z"},"content_sha256":"b2041d0580795ea47688aed91b1bcf9b3d2eed1838c54942963bdcb89ac7a17b","schema_version":"1.0","event_id":"sha256:b2041d0580795ea47688aed91b1bcf9b3d2eed1838c54942963bdcb89ac7a17b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:4EF4NOTC3OPAZ2AYJQTUWHGSGD","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Novel Family of Adaptive Filtering Algorithms Based on The Logarithmic Cost","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Muhammed O. Sayin, N. Denizcan Vanli, Suleyman S. Kozat","submitted_at":"2013-11-26T10:02:20Z","abstract_excerpt":"We introduce a novel family of adaptive filtering algorithms based on a relative logarithmic cost. The new family intrinsically combines the higher and lower order measures of the error into a single continuous update based on the error amount. We introduce important members of this family of algorithms such as the least mean logarithmic square (LMLS) and least logarithmic absolute difference (LLAD) algorithms that improve the convergence performance of the conventional algorithms. However, our approach and analysis are generic such that they cover other well-known cost functions as described "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1311.6809","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-18T01:46:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"22JnMB8BZ0y+RJiiq07+gsGKB+bvYhhnAwFdD1K08p+NGZTDNroXpSIGZPepo9WDKrNu/r+O2oEHm8djDC4hCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-26T01:01:42.505372Z"},"content_sha256":"621202423f7be70f5f9124c5d6caedbe443e02c0c2ec82b9e058790e948006e9","schema_version":"1.0","event_id":"sha256:621202423f7be70f5f9124c5d6caedbe443e02c0c2ec82b9e058790e948006e9"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4EF4NOTC3OPAZ2AYJQTUWHGSGD/bundle.json","state_url":"https://pith.science/pith/4EF4NOTC3OPAZ2AYJQTUWHGSGD/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4EF4NOTC3OPAZ2AYJQTUWHGSGD/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-06-26T01:01:42Z","links":{"resolver":"https://pith.science/pith/4EF4NOTC3OPAZ2AYJQTUWHGSGD","bundle":"https://pith.science/pith/4EF4NOTC3OPAZ2AYJQTUWHGSGD/bundle.json","state":"https://pith.science/pith/4EF4NOTC3OPAZ2AYJQTUWHGSGD/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4EF4NOTC3OPAZ2AYJQTUWHGSGD/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:4EF4NOTC3OPAZ2AYJQTUWHGSGD","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":"2cf9bd60d5a80252ebb0c928298921d18091209de8c54db62a26da1b51e5dfd1","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2013-11-26T10:02:20Z","title_canon_sha256":"f181fca123ba6b7476827908d49945acb82e6a7a19d38e477401c2ece0d65722"},"schema_version":"1.0","source":{"id":"1311.6809","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1311.6809","created_at":"2026-05-18T01:46:05Z"},{"alias_kind":"arxiv_version","alias_value":"1311.6809v1","created_at":"2026-05-18T01:46:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1311.6809","created_at":"2026-05-18T01:46:05Z"},{"alias_kind":"pith_short_12","alias_value":"4EF4NOTC3OPA","created_at":"2026-05-18T12:27:32Z"},{"alias_kind":"pith_short_16","alias_value":"4EF4NOTC3OPAZ2AY","created_at":"2026-05-18T12:27:32Z"},{"alias_kind":"pith_short_8","alias_value":"4EF4NOTC","created_at":"2026-05-18T12:27:32Z"}],"graph_snapshots":[{"event_id":"sha256:621202423f7be70f5f9124c5d6caedbe443e02c0c2ec82b9e058790e948006e9","target":"graph","created_at":"2026-05-18T01:46:05Z","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":"We introduce a novel family of adaptive filtering algorithms based on a relative logarithmic cost. The new family intrinsically combines the higher and lower order measures of the error into a single continuous update based on the error amount. We introduce important members of this family of algorithms such as the least mean logarithmic square (LMLS) and least logarithmic absolute difference (LLAD) algorithms that improve the convergence performance of the conventional algorithms. However, our approach and analysis are generic such that they cover other well-known cost functions as described ","authors_text":"Muhammed O. Sayin, N. Denizcan Vanli, Suleyman S. Kozat","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2013-11-26T10:02:20Z","title":"A Novel Family of Adaptive Filtering Algorithms Based on The Logarithmic Cost"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1311.6809","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:b2041d0580795ea47688aed91b1bcf9b3d2eed1838c54942963bdcb89ac7a17b","target":"record","created_at":"2026-05-18T01:46:05Z","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":"2cf9bd60d5a80252ebb0c928298921d18091209de8c54db62a26da1b51e5dfd1","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2013-11-26T10:02:20Z","title_canon_sha256":"f181fca123ba6b7476827908d49945acb82e6a7a19d38e477401c2ece0d65722"},"schema_version":"1.0","source":{"id":"1311.6809","kind":"arxiv","version":1}},"canonical_sha256":"e10bc6ba62db9e0ce8184c274b1cd230de16053845e6883bce6ba48baa1d19f1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e10bc6ba62db9e0ce8184c274b1cd230de16053845e6883bce6ba48baa1d19f1","first_computed_at":"2026-05-18T01:46:05.920676Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:46:05.920676Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ryP7ykt97YKoz8APMeCRalOSLfLEhfSmK0ruMas9Q7ZOTQ3gYbn8aOq/XaK/PbnWhr7gQWIUQXcuNK6QpEotDg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:46:05.921121Z","signed_message":"canonical_sha256_bytes"},"source_id":"1311.6809","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b2041d0580795ea47688aed91b1bcf9b3d2eed1838c54942963bdcb89ac7a17b","sha256:621202423f7be70f5f9124c5d6caedbe443e02c0c2ec82b9e058790e948006e9"],"state_sha256":"5f7b7722345a672b7e99629f7182c9b3145dfb78d8d52cb178cc543be4477baf"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MFS89FAGckdSL+HkEsgJ63RX2ZiaIp00qcvfuCmN5zhQ7xf3bFfPDt5UE58cd9wR4ykGAryZLJZ97bLageRrAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-26T01:01:42.507395Z","bundle_sha256":"c014dffe3c3795e3e1ebe6e7b4de74891af88048d7828cc4e78acc50d2c844ff"}}