{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:RJDSEMCF4CMGG7LVS7ZMEXX4GZ","short_pith_number":"pith:RJDSEMCF","schema_version":"1.0","canonical_sha256":"8a47223045e098637d7597f2c25efc367c43b0b909cf293ac53e1277cfdd6e30","source":{"kind":"arxiv","id":"2308.09301","version":3},"attestation_state":"computed","paper":{"title":"Automata Learning from Preference and Equivalence Queries","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Eric Hsiung, Joydeep Biswas, Swarat Chaudhuri","submitted_at":"2023-08-18T04:49:45Z","abstract_excerpt":"Active automata learning from membership and equivalence queries is a foundational problem with numerous applications. We propose a novel variant of the active automata learning problem: actively learn finite automata using preference queries -- i.e., queries about the relative position of two sequences in a total order -- instead of membership queries. Our solution is REMAP, a novel algorithm which leverages a symbolic observation table along with unification and constraint solving to navigate a space of symbolic hypotheses (each representing a set of automata), and uses satisfiability-solvin"},"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":"2308.09301","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2023-08-18T04:49:45Z","cross_cats_sorted":[],"title_canon_sha256":"dd7d140e84299217c3ed4cb95f3e8e452b485c20485ed4e2e265eebe843f37e3","abstract_canon_sha256":"7aaa2dfbe83450e83cf530ddbe608357f66d0a790aca152012e951bda0299b85"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:45:12.763714Z","signature_b64":"Tgoxb3ss+uYjEN7ZCPSKsUkLDRMiwt403hDTdOUWoa2NW7vTdSG7nZ2JyNEe0NK2oOnqURAYH6JVRBbM6ej3Dg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8a47223045e098637d7597f2c25efc367c43b0b909cf293ac53e1277cfdd6e30","last_reissued_at":"2026-07-05T11:45:12.763229Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:45:12.763229Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Automata Learning from Preference and Equivalence Queries","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Eric Hsiung, Joydeep Biswas, Swarat Chaudhuri","submitted_at":"2023-08-18T04:49:45Z","abstract_excerpt":"Active automata learning from membership and equivalence queries is a foundational problem with numerous applications. We propose a novel variant of the active automata learning problem: actively learn finite automata using preference queries -- i.e., queries about the relative position of two sequences in a total order -- instead of membership queries. Our solution is REMAP, a novel algorithm which leverages a symbolic observation table along with unification and constraint solving to navigate a space of symbolic hypotheses (each representing a set of automata), and uses satisfiability-solvin"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2308.09301","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/2308.09301/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":"2308.09301","created_at":"2026-07-05T11:45:12.763288+00:00"},{"alias_kind":"arxiv_version","alias_value":"2308.09301v3","created_at":"2026-07-05T11:45:12.763288+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2308.09301","created_at":"2026-07-05T11:45:12.763288+00:00"},{"alias_kind":"pith_short_12","alias_value":"RJDSEMCF4CMG","created_at":"2026-07-05T11:45:12.763288+00:00"},{"alias_kind":"pith_short_16","alias_value":"RJDSEMCF4CMGG7LV","created_at":"2026-07-05T11:45:12.763288+00:00"},{"alias_kind":"pith_short_8","alias_value":"RJDSEMCF","created_at":"2026-07-05T11:45:12.763288+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2411.10601","citing_title":"Learning Quantitative Automata Modulo Theories","ref_index":16,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/RJDSEMCF4CMGG7LVS7ZMEXX4GZ","json":"https://pith.science/pith/RJDSEMCF4CMGG7LVS7ZMEXX4GZ.json","graph_json":"https://pith.science/api/pith-number/RJDSEMCF4CMGG7LVS7ZMEXX4GZ/graph.json","events_json":"https://pith.science/api/pith-number/RJDSEMCF4CMGG7LVS7ZMEXX4GZ/events.json","paper":"https://pith.science/paper/RJDSEMCF"},"agent_actions":{"view_html":"https://pith.science/pith/RJDSEMCF4CMGG7LVS7ZMEXX4GZ","download_json":"https://pith.science/pith/RJDSEMCF4CMGG7LVS7ZMEXX4GZ.json","view_paper":"https://pith.science/paper/RJDSEMCF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2308.09301&json=true","fetch_graph":"https://pith.science/api/pith-number/RJDSEMCF4CMGG7LVS7ZMEXX4GZ/graph.json","fetch_events":"https://pith.science/api/pith-number/RJDSEMCF4CMGG7LVS7ZMEXX4GZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RJDSEMCF4CMGG7LVS7ZMEXX4GZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RJDSEMCF4CMGG7LVS7ZMEXX4GZ/action/storage_attestation","attest_author":"https://pith.science/pith/RJDSEMCF4CMGG7LVS7ZMEXX4GZ/action/author_attestation","sign_citation":"https://pith.science/pith/RJDSEMCF4CMGG7LVS7ZMEXX4GZ/action/citation_signature","submit_replication":"https://pith.science/pith/RJDSEMCF4CMGG7LVS7ZMEXX4GZ/action/replication_record"}},"created_at":"2026-07-05T11:45:12.763288+00:00","updated_at":"2026-07-05T11:45:12.763288+00:00"}