{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:NMAXUCIEJP6F2PQIWUJ6UBZFOU","short_pith_number":"pith:NMAXUCIE","schema_version":"1.0","canonical_sha256":"6b017a09044bfc5d3e08b513ea0725752f2fe3b1a9f9f733ee45ec44d6bdcf7f","source":{"kind":"arxiv","id":"2006.05587","version":3},"attestation_state":"computed","paper":{"title":"Sequential Density Ratio Estimation for Simultaneous Optimization of Speed and Accuracy","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Akinori F. Ebihara, Hitoshi Imaoka, Kazuyuki Sakurai, Taiki Miyagawa","submitted_at":"2020-06-10T01:05:00Z","abstract_excerpt":"Classifying sequential data as early and as accurately as possible is a challenging yet critical problem, especially when a sampling cost is high. One algorithm that achieves this goal is the sequential probability ratio test (SPRT), which is known as Bayes-optimal: it can keep the expected number of data samples as small as possible, given the desired error upper-bound. However, the original SPRT makes two critical assumptions that limit its application in real-world scenarios: (i) samples are independently and identically distributed, and (ii) the likelihood of the data being derived from ea"},"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":"2006.05587","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-06-10T01:05:00Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"931b4407aabbe0dd67721f0be03342cb7060b066d39c9b365a2ec9fd81914f9d","abstract_canon_sha256":"24c0976ef60e455be703ee4d261427bb4ee3f28cf7c7c4c73ae6ee36945266a8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:13:14.906132Z","signature_b64":"EOMhwSP5+kKks4Km0owdUTJ4Rb0nTGsd7QLcFVTdaBMWIJR+Rcjy9IJvBcdFSgiVETF/CV2C4LDyXZgrNzmmCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6b017a09044bfc5d3e08b513ea0725752f2fe3b1a9f9f733ee45ec44d6bdcf7f","last_reissued_at":"2026-07-05T02:13:14.905722Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:13:14.905722Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Sequential Density Ratio Estimation for Simultaneous Optimization of Speed and Accuracy","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Akinori F. Ebihara, Hitoshi Imaoka, Kazuyuki Sakurai, Taiki Miyagawa","submitted_at":"2020-06-10T01:05:00Z","abstract_excerpt":"Classifying sequential data as early and as accurately as possible is a challenging yet critical problem, especially when a sampling cost is high. One algorithm that achieves this goal is the sequential probability ratio test (SPRT), which is known as Bayes-optimal: it can keep the expected number of data samples as small as possible, given the desired error upper-bound. However, the original SPRT makes two critical assumptions that limit its application in real-world scenarios: (i) samples are independently and identically distributed, and (ii) the likelihood of the data being derived from ea"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2006.05587","kind":"arxiv","version":3},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2006.05587/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2006.05587","created_at":"2026-07-05T02:13:14.905790+00:00"},{"alias_kind":"arxiv_version","alias_value":"2006.05587v3","created_at":"2026-07-05T02:13:14.905790+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2006.05587","created_at":"2026-07-05T02:13:14.905790+00:00"},{"alias_kind":"pith_short_12","alias_value":"NMAXUCIEJP6F","created_at":"2026-07-05T02:13:14.905790+00:00"},{"alias_kind":"pith_short_16","alias_value":"NMAXUCIEJP6F2PQI","created_at":"2026-07-05T02:13:14.905790+00:00"},{"alias_kind":"pith_short_8","alias_value":"NMAXUCIE","created_at":"2026-07-05T02:13:14.905790+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2502.06584","citing_title":"Deep Reinforcement Learning based Triggering Function for Early Classifiers of Time Series","ref_index":10,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/NMAXUCIEJP6F2PQIWUJ6UBZFOU","json":"https://pith.science/pith/NMAXUCIEJP6F2PQIWUJ6UBZFOU.json","graph_json":"https://pith.science/api/pith-number/NMAXUCIEJP6F2PQIWUJ6UBZFOU/graph.json","events_json":"https://pith.science/api/pith-number/NMAXUCIEJP6F2PQIWUJ6UBZFOU/events.json","paper":"https://pith.science/paper/NMAXUCIE"},"agent_actions":{"view_html":"https://pith.science/pith/NMAXUCIEJP6F2PQIWUJ6UBZFOU","download_json":"https://pith.science/pith/NMAXUCIEJP6F2PQIWUJ6UBZFOU.json","view_paper":"https://pith.science/paper/NMAXUCIE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2006.05587&json=true","fetch_graph":"https://pith.science/api/pith-number/NMAXUCIEJP6F2PQIWUJ6UBZFOU/graph.json","fetch_events":"https://pith.science/api/pith-number/NMAXUCIEJP6F2PQIWUJ6UBZFOU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NMAXUCIEJP6F2PQIWUJ6UBZFOU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NMAXUCIEJP6F2PQIWUJ6UBZFOU/action/storage_attestation","attest_author":"https://pith.science/pith/NMAXUCIEJP6F2PQIWUJ6UBZFOU/action/author_attestation","sign_citation":"https://pith.science/pith/NMAXUCIEJP6F2PQIWUJ6UBZFOU/action/citation_signature","submit_replication":"https://pith.science/pith/NMAXUCIEJP6F2PQIWUJ6UBZFOU/action/replication_record"}},"created_at":"2026-07-05T02:13:14.905790+00:00","updated_at":"2026-07-05T02:13:14.905790+00:00"}