{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:JQ5HEOLRKXNIQADA5FVRUT4D6M","short_pith_number":"pith:JQ5HEOLR","schema_version":"1.0","canonical_sha256":"4c3a72397155da880060e96b1a4f83f30c5fc69271730df1f96746649b9c3af9","source":{"kind":"arxiv","id":"1302.2273","version":1},"attestation_state":"computed","paper":{"title":"Learning Universally Quantified Invariants of Linear Data Structures","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.FL","cs.LG"],"primary_cat":"cs.PL","authors_text":"Christof Loding, Daniel Neider, P. Madhusudan, Pranav Garg","submitted_at":"2013-02-09T21:41:03Z","abstract_excerpt":"We propose a new automaton model, called quantified data automata over words, that can model quantified invariants over linear data structures, and build poly-time active learning algorithms for them, where the learner is allowed to query the teacher with membership and equivalence queries. In order to express invariants in decidable logics, we invent a decidable subclass of QDAs, called elastic QDAs, and prove that every QDA has a unique minimally-over-approximating elastic QDA. We then give an application of these theoretically sound and efficient active learning algorithms in a passive lear"},"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":"1302.2273","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2013-02-09T21:41:03Z","cross_cats_sorted":["cs.FL","cs.LG"],"title_canon_sha256":"30fcd5f928e31ca24682cfdaeeeaca6f2d730a6faded274b39ec5328c4469759","abstract_canon_sha256":"a174a06aab19a8efdd9d89b38dc903591f89595ea78421fc5f57aa9999c8de4e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:34:01.805851Z","signature_b64":"Z6OseHxA+8Yrn8ehBdDuoRRH7IHkNGg7v7kFTzfHf4kpBiWL18124QwH/8Xy5jr4QYEPyQiBUrZz1MTjPMXYBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4c3a72397155da880060e96b1a4f83f30c5fc69271730df1f96746649b9c3af9","last_reissued_at":"2026-05-18T03:34:01.805078Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:34:01.805078Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Learning Universally Quantified Invariants of Linear Data Structures","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.FL","cs.LG"],"primary_cat":"cs.PL","authors_text":"Christof Loding, Daniel Neider, P. Madhusudan, Pranav Garg","submitted_at":"2013-02-09T21:41:03Z","abstract_excerpt":"We propose a new automaton model, called quantified data automata over words, that can model quantified invariants over linear data structures, and build poly-time active learning algorithms for them, where the learner is allowed to query the teacher with membership and equivalence queries. In order to express invariants in decidable logics, we invent a decidable subclass of QDAs, called elastic QDAs, and prove that every QDA has a unique minimally-over-approximating elastic QDA. We then give an application of these theoretically sound and efficient active learning algorithms in a passive lear"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1302.2273","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1302.2273","created_at":"2026-05-18T03:34:01.805189+00:00"},{"alias_kind":"arxiv_version","alias_value":"1302.2273v1","created_at":"2026-05-18T03:34:01.805189+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1302.2273","created_at":"2026-05-18T03:34:01.805189+00:00"},{"alias_kind":"pith_short_12","alias_value":"JQ5HEOLRKXNI","created_at":"2026-05-18T12:27:49.015174+00:00"},{"alias_kind":"pith_short_16","alias_value":"JQ5HEOLRKXNIQADA","created_at":"2026-05-18T12:27:49.015174+00:00"},{"alias_kind":"pith_short_8","alias_value":"JQ5HEOLR","created_at":"2026-05-18T12:27:49.015174+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/JQ5HEOLRKXNIQADA5FVRUT4D6M","json":"https://pith.science/pith/JQ5HEOLRKXNIQADA5FVRUT4D6M.json","graph_json":"https://pith.science/api/pith-number/JQ5HEOLRKXNIQADA5FVRUT4D6M/graph.json","events_json":"https://pith.science/api/pith-number/JQ5HEOLRKXNIQADA5FVRUT4D6M/events.json","paper":"https://pith.science/paper/JQ5HEOLR"},"agent_actions":{"view_html":"https://pith.science/pith/JQ5HEOLRKXNIQADA5FVRUT4D6M","download_json":"https://pith.science/pith/JQ5HEOLRKXNIQADA5FVRUT4D6M.json","view_paper":"https://pith.science/paper/JQ5HEOLR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1302.2273&json=true","fetch_graph":"https://pith.science/api/pith-number/JQ5HEOLRKXNIQADA5FVRUT4D6M/graph.json","fetch_events":"https://pith.science/api/pith-number/JQ5HEOLRKXNIQADA5FVRUT4D6M/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JQ5HEOLRKXNIQADA5FVRUT4D6M/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JQ5HEOLRKXNIQADA5FVRUT4D6M/action/storage_attestation","attest_author":"https://pith.science/pith/JQ5HEOLRKXNIQADA5FVRUT4D6M/action/author_attestation","sign_citation":"https://pith.science/pith/JQ5HEOLRKXNIQADA5FVRUT4D6M/action/citation_signature","submit_replication":"https://pith.science/pith/JQ5HEOLRKXNIQADA5FVRUT4D6M/action/replication_record"}},"created_at":"2026-05-18T03:34:01.805189+00:00","updated_at":"2026-05-18T03:34:01.805189+00:00"}