{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:3JN6F6XA4ACO3VSSC635H3UTPJ","short_pith_number":"pith:3JN6F6XA","schema_version":"1.0","canonical_sha256":"da5be2fae0e004edd65217b7d3ee937a41d206d9fb5597f805eee4b65f879994","source":{"kind":"arxiv","id":"2008.09909","version":2},"attestation_state":"computed","paper":{"title":"Learning the Boundary of Inductive Invariants","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.PL","authors_text":"James R. Wilcox, Mooly Sagiv, Sharon Shoham, Yotam M. Y. Feldman","submitted_at":"2020-08-22T20:34:13Z","abstract_excerpt":"We study the complexity of invariant inference and its connections to exact concept learning. We define a condition on invariants and their geometry, called the fence condition, which permits applying theoretical results from exact concept learning to answer open problems in invariant inference theory. The condition requires the invariant's boundary---the states whose Hamming distance from the invariant is one---to be backwards reachable from the bad states in a small number of steps. Using this condition, we obtain the first polynomial complexity result for an interpolation-based invariant in"},"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":"2008.09909","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2020-08-22T20:34:13Z","cross_cats_sorted":[],"title_canon_sha256":"3d78dcc938506a450122378d7407213a8f7349b543601f518c84db1435a30922","abstract_canon_sha256":"9f882faf37c7d4d37fa0784eeb32f1e77ba4a2a1782c1fded3e5ef8a5281c8dc"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:50:29.534994Z","signature_b64":"hnpwrkk03M7+4C9iAFmwSAufBw8kd18wS9HRGZr/aSv6hEWl17SiFpt84gc0oD4zk5BOSiGBLq+svQROOzpEBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"da5be2fae0e004edd65217b7d3ee937a41d206d9fb5597f805eee4b65f879994","last_reissued_at":"2026-07-05T01:50:29.534486Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:50:29.534486Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Learning the Boundary of Inductive Invariants","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.PL","authors_text":"James R. Wilcox, Mooly Sagiv, Sharon Shoham, Yotam M. Y. Feldman","submitted_at":"2020-08-22T20:34:13Z","abstract_excerpt":"We study the complexity of invariant inference and its connections to exact concept learning. We define a condition on invariants and their geometry, called the fence condition, which permits applying theoretical results from exact concept learning to answer open problems in invariant inference theory. The condition requires the invariant's boundary---the states whose Hamming distance from the invariant is one---to be backwards reachable from the bad states in a small number of steps. Using this condition, we obtain the first polynomial complexity result for an interpolation-based invariant in"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2008.09909","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2008.09909/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":"2008.09909","created_at":"2026-07-05T01:50:29.534542+00:00"},{"alias_kind":"arxiv_version","alias_value":"2008.09909v2","created_at":"2026-07-05T01:50:29.534542+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2008.09909","created_at":"2026-07-05T01:50:29.534542+00:00"},{"alias_kind":"pith_short_12","alias_value":"3JN6F6XA4ACO","created_at":"2026-07-05T01:50:29.534542+00:00"},{"alias_kind":"pith_short_16","alias_value":"3JN6F6XA4ACO3VSS","created_at":"2026-07-05T01:50:29.534542+00:00"},{"alias_kind":"pith_short_8","alias_value":"3JN6F6XA","created_at":"2026-07-05T01:50:29.534542+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/3JN6F6XA4ACO3VSSC635H3UTPJ","json":"https://pith.science/pith/3JN6F6XA4ACO3VSSC635H3UTPJ.json","graph_json":"https://pith.science/api/pith-number/3JN6F6XA4ACO3VSSC635H3UTPJ/graph.json","events_json":"https://pith.science/api/pith-number/3JN6F6XA4ACO3VSSC635H3UTPJ/events.json","paper":"https://pith.science/paper/3JN6F6XA"},"agent_actions":{"view_html":"https://pith.science/pith/3JN6F6XA4ACO3VSSC635H3UTPJ","download_json":"https://pith.science/pith/3JN6F6XA4ACO3VSSC635H3UTPJ.json","view_paper":"https://pith.science/paper/3JN6F6XA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2008.09909&json=true","fetch_graph":"https://pith.science/api/pith-number/3JN6F6XA4ACO3VSSC635H3UTPJ/graph.json","fetch_events":"https://pith.science/api/pith-number/3JN6F6XA4ACO3VSSC635H3UTPJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3JN6F6XA4ACO3VSSC635H3UTPJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3JN6F6XA4ACO3VSSC635H3UTPJ/action/storage_attestation","attest_author":"https://pith.science/pith/3JN6F6XA4ACO3VSSC635H3UTPJ/action/author_attestation","sign_citation":"https://pith.science/pith/3JN6F6XA4ACO3VSSC635H3UTPJ/action/citation_signature","submit_replication":"https://pith.science/pith/3JN6F6XA4ACO3VSSC635H3UTPJ/action/replication_record"}},"created_at":"2026-07-05T01:50:29.534542+00:00","updated_at":"2026-07-05T01:50:29.534542+00:00"}