{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2020:3JN6F6XA4ACO3VSSC635H3UTPJ","short_pith_number":"pith:3JN6F6XA","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"},"canonical_sha256":"da5be2fae0e004edd65217b7d3ee937a41d206d9fb5597f805eee4b65f879994","source":{"kind":"arxiv","id":"2008.09909","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2008.09909","created_at":"2026-07-05T01:50:29Z"},{"alias_kind":"arxiv_version","alias_value":"2008.09909v2","created_at":"2026-07-05T01:50:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2008.09909","created_at":"2026-07-05T01:50:29Z"},{"alias_kind":"pith_short_12","alias_value":"3JN6F6XA4ACO","created_at":"2026-07-05T01:50:29Z"},{"alias_kind":"pith_short_16","alias_value":"3JN6F6XA4ACO3VSS","created_at":"2026-07-05T01:50:29Z"},{"alias_kind":"pith_short_8","alias_value":"3JN6F6XA","created_at":"2026-07-05T01:50:29Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2020:3JN6F6XA4ACO3VSSC635H3UTPJ","target":"record","payload":{"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"},"canonical_sha256":"da5be2fae0e004edd65217b7d3ee937a41d206d9fb5597f805eee4b65f879994","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"},"source_kind":"arxiv","source_id":"2008.09909","source_version":2,"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-07-05T01:50:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8rXc5uGcCavPXpB682aLzxaN46vuKPShIA0bQSnfN8qJ11xVyfbJA+2r7l/RLkA/uC4M0gSkle99LkCZjm80DQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-05T02:18:13.435460Z"},"content_sha256":"66805865ec67cce7bebc249859457dfd6ceb1420db23f859f77b880bc36471cc","schema_version":"1.0","event_id":"sha256:66805865ec67cce7bebc249859457dfd6ceb1420db23f859f77b880bc36471cc"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2020:3JN6F6XA4ACO3VSSC635H3UTPJ","target":"graph","payload":{"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"},"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-07-05T01:50:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CMNx3ewekp3vkSwgp7GkVEt28AzO/YrIHoogo+0X2yOGBJvpLlO7FK1G5jF0ddb35dGRZNqhrufUg2rNSGzYDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-05T02:18:13.437091Z"},"content_sha256":"0df3dff31b3a3a1eba8eb5322c47f37ef1f5b12cde39f216a309f06d6c1aa512","schema_version":"1.0","event_id":"sha256:0df3dff31b3a3a1eba8eb5322c47f37ef1f5b12cde39f216a309f06d6c1aa512"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3JN6F6XA4ACO3VSSC635H3UTPJ/bundle.json","state_url":"https://pith.science/pith/3JN6F6XA4ACO3VSSC635H3UTPJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3JN6F6XA4ACO3VSSC635H3UTPJ/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-08-05T02:18:13Z","links":{"resolver":"https://pith.science/pith/3JN6F6XA4ACO3VSSC635H3UTPJ","bundle":"https://pith.science/pith/3JN6F6XA4ACO3VSSC635H3UTPJ/bundle.json","state":"https://pith.science/pith/3JN6F6XA4ACO3VSSC635H3UTPJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3JN6F6XA4ACO3VSSC635H3UTPJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:3JN6F6XA4ACO3VSSC635H3UTPJ","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":"9f882faf37c7d4d37fa0784eeb32f1e77ba4a2a1782c1fded3e5ef8a5281c8dc","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2020-08-22T20:34:13Z","title_canon_sha256":"3d78dcc938506a450122378d7407213a8f7349b543601f518c84db1435a30922"},"schema_version":"1.0","source":{"id":"2008.09909","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2008.09909","created_at":"2026-07-05T01:50:29Z"},{"alias_kind":"arxiv_version","alias_value":"2008.09909v2","created_at":"2026-07-05T01:50:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2008.09909","created_at":"2026-07-05T01:50:29Z"},{"alias_kind":"pith_short_12","alias_value":"3JN6F6XA4ACO","created_at":"2026-07-05T01:50:29Z"},{"alias_kind":"pith_short_16","alias_value":"3JN6F6XA4ACO3VSS","created_at":"2026-07-05T01:50:29Z"},{"alias_kind":"pith_short_8","alias_value":"3JN6F6XA","created_at":"2026-07-05T01:50:29Z"}],"graph_snapshots":[{"event_id":"sha256:0df3dff31b3a3a1eba8eb5322c47f37ef1f5b12cde39f216a309f06d6c1aa512","target":"graph","created_at":"2026-07-05T01:50:29Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2008.09909/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"James R. Wilcox, Mooly Sagiv, Sharon Shoham, Yotam M. Y. Feldman","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2020-08-22T20:34:13Z","title":"Learning the Boundary of Inductive Invariants"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2008.09909","kind":"arxiv","version":2},"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:66805865ec67cce7bebc249859457dfd6ceb1420db23f859f77b880bc36471cc","target":"record","created_at":"2026-07-05T01:50:29Z","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":"9f882faf37c7d4d37fa0784eeb32f1e77ba4a2a1782c1fded3e5ef8a5281c8dc","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2020-08-22T20:34:13Z","title_canon_sha256":"3d78dcc938506a450122378d7407213a8f7349b543601f518c84db1435a30922"},"schema_version":"1.0","source":{"id":"2008.09909","kind":"arxiv","version":2}},"canonical_sha256":"da5be2fae0e004edd65217b7d3ee937a41d206d9fb5597f805eee4b65f879994","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"da5be2fae0e004edd65217b7d3ee937a41d206d9fb5597f805eee4b65f879994","first_computed_at":"2026-07-05T01:50:29.534486Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T01:50:29.534486Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"hnpwrkk03M7+4C9iAFmwSAufBw8kd18wS9HRGZr/aSv6hEWl17SiFpt84gc0oD4zk5BOSiGBLq+svQROOzpEBw==","signature_status":"signed_v1","signed_at":"2026-07-05T01:50:29.534994Z","signed_message":"canonical_sha256_bytes"},"source_id":"2008.09909","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:66805865ec67cce7bebc249859457dfd6ceb1420db23f859f77b880bc36471cc","sha256:0df3dff31b3a3a1eba8eb5322c47f37ef1f5b12cde39f216a309f06d6c1aa512"],"state_sha256":"e8c3dc44b06861e6bf3c8bc39ef7eeaf863edbea8f0c0466ed4a5683a8dd5ee6"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sCulj4OmVIkprC7LjygGcSjzfTBVEekBX8cPPpo3JyuhxrtKVNuBTQRPPTvmU2onHhbX7yk5QBYdLBwTGWLRDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-05T02:18:13.443361Z","bundle_sha256":"1d249ca09929a59b1b2148a0c700a9f601f61359d699fd44692eb4a0b2f591a9"}}