{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:MPMZZK3BKPJ6WDONPBGPQ3TXCB","short_pith_number":"pith:MPMZZK3B","canonical_record":{"source":{"id":"1501.07174","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SE","submitted_at":"2015-01-28T16:17:58Z","cross_cats_sorted":[],"title_canon_sha256":"2b88acf2824ea08707cd08d6a8a7d586648e5b3113c90faebdf225fefbfd7345","abstract_canon_sha256":"db8b306b5815df45015f61717b3b8158294a3076da10a58eb3dd945d98735197"},"schema_version":"1.0"},"canonical_sha256":"63d99cab6153d3eb0dcd784cf86e77107a5789abe9c5f81a923b34b04e89a878","source":{"kind":"arxiv","id":"1501.07174","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1501.07174","created_at":"2026-05-18T02:28:29Z"},{"alias_kind":"arxiv_version","alias_value":"1501.07174v1","created_at":"2026-05-18T02:28:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1501.07174","created_at":"2026-05-18T02:28:29Z"},{"alias_kind":"pith_short_12","alias_value":"MPMZZK3BKPJ6","created_at":"2026-05-18T12:29:32Z"},{"alias_kind":"pith_short_16","alias_value":"MPMZZK3BKPJ6WDON","created_at":"2026-05-18T12:29:32Z"},{"alias_kind":"pith_short_8","alias_value":"MPMZZK3B","created_at":"2026-05-18T12:29:32Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:MPMZZK3BKPJ6WDONPBGPQ3TXCB","target":"record","payload":{"canonical_record":{"source":{"id":"1501.07174","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SE","submitted_at":"2015-01-28T16:17:58Z","cross_cats_sorted":[],"title_canon_sha256":"2b88acf2824ea08707cd08d6a8a7d586648e5b3113c90faebdf225fefbfd7345","abstract_canon_sha256":"db8b306b5815df45015f61717b3b8158294a3076da10a58eb3dd945d98735197"},"schema_version":"1.0"},"canonical_sha256":"63d99cab6153d3eb0dcd784cf86e77107a5789abe9c5f81a923b34b04e89a878","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:28:29.980952Z","signature_b64":"9LFG8OvFQaiNBTw140SkJWNfqOe7DamuV+o/jucNsawJtIc0JGID0uyWgWOBzKm8gVzMUuD0nz9NXKoTa/1NDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"63d99cab6153d3eb0dcd784cf86e77107a5789abe9c5f81a923b34b04e89a878","last_reissued_at":"2026-05-18T02:28:29.980531Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:28:29.980531Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1501.07174","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-18T02:28:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PCNC9Y6P9+ZgD2JutbfMiXoVHQ8RJdU3oiHyLwEi5gHg/hc6Re/4n/AYQSR8VxcWnhaDExl0jHtcX6heC90CBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T05:40:04.809513Z"},"content_sha256":"bd6dea50c44063ca989b37d83b13302659695069bf2eda4ff07b73b17e959826","schema_version":"1.0","event_id":"sha256:bd6dea50c44063ca989b37d83b13302659695069bf2eda4ff07b73b17e959826"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:MPMZZK3BKPJ6WDONPBGPQ3TXCB","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Enhancing Reuse of Constraint Solutions to Improve Symbolic Execution","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.SE","authors_text":"Carlo Ghezzi, Shi Ying, Xiangyang Jia","submitted_at":"2015-01-28T16:17:58Z","abstract_excerpt":"Constraint solution reuse is an effective approach to save the time of constraint solving in symbolic execution. Most of the existing reuse approaches are based on syntactic or semantic equivalence of constraints; e.g. the Green framework is able to reuse constraints which have different representations but are semantically equivalent, through canonizing constraints into syntactically equivalent normal forms. However, syntactic/semantic equivalence is not a necessary condition for reuse--some constraints are not syntactically or semantically equivalent, but their solutions still have potential"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1501.07174","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-18T02:28:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0BefAmtnOWGmGnIloskpZ8NWEZRcBBnA3ctzj5qdYB+NKFGSvPBuD9o0MVgMQEXqJXF7iM/Ru27BRgEGUmRxDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T05:40:04.810207Z"},"content_sha256":"6a548670db7fc49e24680e12e2f86379020c16f882a98898a1af1b0a325d98cf","schema_version":"1.0","event_id":"sha256:6a548670db7fc49e24680e12e2f86379020c16f882a98898a1af1b0a325d98cf"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MPMZZK3BKPJ6WDONPBGPQ3TXCB/bundle.json","state_url":"https://pith.science/pith/MPMZZK3BKPJ6WDONPBGPQ3TXCB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MPMZZK3BKPJ6WDONPBGPQ3TXCB/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-09T05:40:04Z","links":{"resolver":"https://pith.science/pith/MPMZZK3BKPJ6WDONPBGPQ3TXCB","bundle":"https://pith.science/pith/MPMZZK3BKPJ6WDONPBGPQ3TXCB/bundle.json","state":"https://pith.science/pith/MPMZZK3BKPJ6WDONPBGPQ3TXCB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MPMZZK3BKPJ6WDONPBGPQ3TXCB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:MPMZZK3BKPJ6WDONPBGPQ3TXCB","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":"db8b306b5815df45015f61717b3b8158294a3076da10a58eb3dd945d98735197","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SE","submitted_at":"2015-01-28T16:17:58Z","title_canon_sha256":"2b88acf2824ea08707cd08d6a8a7d586648e5b3113c90faebdf225fefbfd7345"},"schema_version":"1.0","source":{"id":"1501.07174","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1501.07174","created_at":"2026-05-18T02:28:29Z"},{"alias_kind":"arxiv_version","alias_value":"1501.07174v1","created_at":"2026-05-18T02:28:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1501.07174","created_at":"2026-05-18T02:28:29Z"},{"alias_kind":"pith_short_12","alias_value":"MPMZZK3BKPJ6","created_at":"2026-05-18T12:29:32Z"},{"alias_kind":"pith_short_16","alias_value":"MPMZZK3BKPJ6WDON","created_at":"2026-05-18T12:29:32Z"},{"alias_kind":"pith_short_8","alias_value":"MPMZZK3B","created_at":"2026-05-18T12:29:32Z"}],"graph_snapshots":[{"event_id":"sha256:6a548670db7fc49e24680e12e2f86379020c16f882a98898a1af1b0a325d98cf","target":"graph","created_at":"2026-05-18T02:28: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"},"paper":{"abstract_excerpt":"Constraint solution reuse is an effective approach to save the time of constraint solving in symbolic execution. Most of the existing reuse approaches are based on syntactic or semantic equivalence of constraints; e.g. the Green framework is able to reuse constraints which have different representations but are semantically equivalent, through canonizing constraints into syntactically equivalent normal forms. However, syntactic/semantic equivalence is not a necessary condition for reuse--some constraints are not syntactically or semantically equivalent, but their solutions still have potential","authors_text":"Carlo Ghezzi, Shi Ying, Xiangyang Jia","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SE","submitted_at":"2015-01-28T16:17:58Z","title":"Enhancing Reuse of Constraint Solutions to Improve Symbolic Execution"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1501.07174","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:bd6dea50c44063ca989b37d83b13302659695069bf2eda4ff07b73b17e959826","target":"record","created_at":"2026-05-18T02:28: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":"db8b306b5815df45015f61717b3b8158294a3076da10a58eb3dd945d98735197","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SE","submitted_at":"2015-01-28T16:17:58Z","title_canon_sha256":"2b88acf2824ea08707cd08d6a8a7d586648e5b3113c90faebdf225fefbfd7345"},"schema_version":"1.0","source":{"id":"1501.07174","kind":"arxiv","version":1}},"canonical_sha256":"63d99cab6153d3eb0dcd784cf86e77107a5789abe9c5f81a923b34b04e89a878","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"63d99cab6153d3eb0dcd784cf86e77107a5789abe9c5f81a923b34b04e89a878","first_computed_at":"2026-05-18T02:28:29.980531Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:28:29.980531Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"9LFG8OvFQaiNBTw140SkJWNfqOe7DamuV+o/jucNsawJtIc0JGID0uyWgWOBzKm8gVzMUuD0nz9NXKoTa/1NDg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:28:29.980952Z","signed_message":"canonical_sha256_bytes"},"source_id":"1501.07174","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:bd6dea50c44063ca989b37d83b13302659695069bf2eda4ff07b73b17e959826","sha256:6a548670db7fc49e24680e12e2f86379020c16f882a98898a1af1b0a325d98cf"],"state_sha256":"8a6428b0ddbf264c7aa8495b7106c9d921ebdc112906e2edab1a5e72ea712d4b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YC5xaSTtcML3r6vD258W7td7n0oyUjdmlHrd/91oBBFhfdc8ko2XkkYOxv/y6naQweHmarps+oyGROyt2HyAAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T05:40:04.817684Z","bundle_sha256":"460519317516dd7080a45b04d4b4859200ea249de9ee1ca41e18f2f48c7c4f5c"}}