{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:OYV3THN4FOCEQ3WBNKYHEQNZFB","short_pith_number":"pith:OYV3THN4","canonical_record":{"source":{"id":"1903.11768","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SE","submitted_at":"2019-03-28T02:55:53Z","cross_cats_sorted":[],"title_canon_sha256":"640dd828f732a4119a368900a71b1126dbac5a035e77eeec76d6c0eada7cf20a","abstract_canon_sha256":"ef556549c54196df331cca6bbd0451d276028b450c98ff73e1a1b6e205f2c200"},"schema_version":"1.0"},"canonical_sha256":"762bb99dbc2b84486ec16ab07241b9287830e921a4413cb1933beba30ce9cda6","source":{"kind":"arxiv","id":"1903.11768","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1903.11768","created_at":"2026-05-17T23:50:01Z"},{"alias_kind":"arxiv_version","alias_value":"1903.11768v1","created_at":"2026-05-17T23:50:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.11768","created_at":"2026-05-17T23:50:01Z"},{"alias_kind":"pith_short_12","alias_value":"OYV3THN4FOCE","created_at":"2026-05-18T12:33:24Z"},{"alias_kind":"pith_short_16","alias_value":"OYV3THN4FOCEQ3WB","created_at":"2026-05-18T12:33:24Z"},{"alias_kind":"pith_short_8","alias_value":"OYV3THN4","created_at":"2026-05-18T12:33:24Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:OYV3THN4FOCEQ3WBNKYHEQNZFB","target":"record","payload":{"canonical_record":{"source":{"id":"1903.11768","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SE","submitted_at":"2019-03-28T02:55:53Z","cross_cats_sorted":[],"title_canon_sha256":"640dd828f732a4119a368900a71b1126dbac5a035e77eeec76d6c0eada7cf20a","abstract_canon_sha256":"ef556549c54196df331cca6bbd0451d276028b450c98ff73e1a1b6e205f2c200"},"schema_version":"1.0"},"canonical_sha256":"762bb99dbc2b84486ec16ab07241b9287830e921a4413cb1933beba30ce9cda6","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:50:01.836076Z","signature_b64":"a+gtx7NSY0Qj3kVAO0ZV9TKarXr0hsoIwNNk1gVOrlNn3s/R/ZFGFpWpqawbW8q3WQJN5syDjfgnRbv9nAx+Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"762bb99dbc2b84486ec16ab07241b9287830e921a4413cb1933beba30ce9cda6","last_reissued_at":"2026-05-17T23:50:01.835612Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:50:01.835612Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1903.11768","source_version":1,"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-05-17T23:50:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"schpGZ4Tuw8zEbKlmGq8lsNcx3OB99e7IFSkYq9iaDIpmEBie8Aq0CCmwUaK7Rv35eG9jNnmU00+HX5hqIxCDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T09:26:45.148492Z"},"content_sha256":"fcf0f18a3f7a122606f346966b7c6bf16e1d818c2ba526cee5efa9d0558aaff1","schema_version":"1.0","event_id":"sha256:fcf0f18a3f7a122606f346966b7c6bf16e1d818c2ba526cee5efa9d0558aaff1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:OYV3THN4FOCEQ3WBNKYHEQNZFB","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"SymInfer: Inferring Program Invariants using Symbolic States","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.SE","authors_text":"Matthew B. Dwyer, ThanhVu Nguyen, Willem Visser","submitted_at":"2019-03-28T02:55:53Z","abstract_excerpt":"We introduce a new technique for inferring program invariants that uses symbolic states generated by symbolic execution. Symbolic states, which consist of path conditions and constraints on local variables, are a compact description of sets of concrete program states and they can be used for both invariant inference and invariant verification. Our technique uses a counterexample-based algorithm that creates concrete states from symbolic states, infers candidate invariants from concrete states, and then verifies or refutes candidate invariants using symbolic states. The refutation case produces"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.11768","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"},"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-05-17T23:50:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cFh6tRECPJmVvXHwhhyxjqOEL4PkSn1dpG9PFRw8qv2QHKfvWQUA6QdbXmwSiqd2y4uLkIDachAcGi+OAIcXDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T09:26:45.148837Z"},"content_sha256":"d1bc31351b6f68d7a1fcb813d6f4fd749141204429e293bfc7d83c9ca4b1460b","schema_version":"1.0","event_id":"sha256:d1bc31351b6f68d7a1fcb813d6f4fd749141204429e293bfc7d83c9ca4b1460b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OYV3THN4FOCEQ3WBNKYHEQNZFB/bundle.json","state_url":"https://pith.science/pith/OYV3THN4FOCEQ3WBNKYHEQNZFB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OYV3THN4FOCEQ3WBNKYHEQNZFB/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-06-05T09:26:45Z","links":{"resolver":"https://pith.science/pith/OYV3THN4FOCEQ3WBNKYHEQNZFB","bundle":"https://pith.science/pith/OYV3THN4FOCEQ3WBNKYHEQNZFB/bundle.json","state":"https://pith.science/pith/OYV3THN4FOCEQ3WBNKYHEQNZFB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OYV3THN4FOCEQ3WBNKYHEQNZFB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:OYV3THN4FOCEQ3WBNKYHEQNZFB","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":"ef556549c54196df331cca6bbd0451d276028b450c98ff73e1a1b6e205f2c200","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SE","submitted_at":"2019-03-28T02:55:53Z","title_canon_sha256":"640dd828f732a4119a368900a71b1126dbac5a035e77eeec76d6c0eada7cf20a"},"schema_version":"1.0","source":{"id":"1903.11768","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1903.11768","created_at":"2026-05-17T23:50:01Z"},{"alias_kind":"arxiv_version","alias_value":"1903.11768v1","created_at":"2026-05-17T23:50:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.11768","created_at":"2026-05-17T23:50:01Z"},{"alias_kind":"pith_short_12","alias_value":"OYV3THN4FOCE","created_at":"2026-05-18T12:33:24Z"},{"alias_kind":"pith_short_16","alias_value":"OYV3THN4FOCEQ3WB","created_at":"2026-05-18T12:33:24Z"},{"alias_kind":"pith_short_8","alias_value":"OYV3THN4","created_at":"2026-05-18T12:33:24Z"}],"graph_snapshots":[{"event_id":"sha256:d1bc31351b6f68d7a1fcb813d6f4fd749141204429e293bfc7d83c9ca4b1460b","target":"graph","created_at":"2026-05-17T23:50:01Z","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"},"paper":{"abstract_excerpt":"We introduce a new technique for inferring program invariants that uses symbolic states generated by symbolic execution. Symbolic states, which consist of path conditions and constraints on local variables, are a compact description of sets of concrete program states and they can be used for both invariant inference and invariant verification. Our technique uses a counterexample-based algorithm that creates concrete states from symbolic states, infers candidate invariants from concrete states, and then verifies or refutes candidate invariants using symbolic states. The refutation case produces","authors_text":"Matthew B. Dwyer, ThanhVu Nguyen, Willem Visser","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SE","submitted_at":"2019-03-28T02:55:53Z","title":"SymInfer: Inferring Program Invariants using Symbolic States"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.11768","kind":"arxiv","version":1},"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:fcf0f18a3f7a122606f346966b7c6bf16e1d818c2ba526cee5efa9d0558aaff1","target":"record","created_at":"2026-05-17T23:50:01Z","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":"ef556549c54196df331cca6bbd0451d276028b450c98ff73e1a1b6e205f2c200","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SE","submitted_at":"2019-03-28T02:55:53Z","title_canon_sha256":"640dd828f732a4119a368900a71b1126dbac5a035e77eeec76d6c0eada7cf20a"},"schema_version":"1.0","source":{"id":"1903.11768","kind":"arxiv","version":1}},"canonical_sha256":"762bb99dbc2b84486ec16ab07241b9287830e921a4413cb1933beba30ce9cda6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"762bb99dbc2b84486ec16ab07241b9287830e921a4413cb1933beba30ce9cda6","first_computed_at":"2026-05-17T23:50:01.835612Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:50:01.835612Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"a+gtx7NSY0Qj3kVAO0ZV9TKarXr0hsoIwNNk1gVOrlNn3s/R/ZFGFpWpqawbW8q3WQJN5syDjfgnRbv9nAx+Ag==","signature_status":"signed_v1","signed_at":"2026-05-17T23:50:01.836076Z","signed_message":"canonical_sha256_bytes"},"source_id":"1903.11768","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:fcf0f18a3f7a122606f346966b7c6bf16e1d818c2ba526cee5efa9d0558aaff1","sha256:d1bc31351b6f68d7a1fcb813d6f4fd749141204429e293bfc7d83c9ca4b1460b"],"state_sha256":"10001137e6fc7e00a322c33e8212526f56e32321580bd0dd565dc5cf100ac477"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Z0LPoduuSmve4BnW1l09Mjr+3bCt5sdTB7vxZ8Sce3yxZi21qCydLlMLl3DzAfCVsT8NGJZLu3KWB4u6GcmkDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T09:26:45.150820Z","bundle_sha256":"ade682989ca34a642eea98997d600cb1a7780aad5c1fdd8c5d3a84aed33618c4"}}