{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:HB6MDLKQXX4YWN6XS6S4HU4GKY","short_pith_number":"pith:HB6MDLKQ","canonical_record":{"source":{"id":"1505.02637","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2015-05-11T14:28:51Z","cross_cats_sorted":[],"title_canon_sha256":"3923b5f6e9d16becd52729a297940f395a706db0c4a3631372198b46eccac9d3","abstract_canon_sha256":"8f807305066f6dfd4c7ff1c94a87bf7921e81e53d2e7d3194d408fd9a137569f"},"schema_version":"1.0"},"canonical_sha256":"387cc1ad50bdf98b37d797a5c3d386563004273f9e4d4921bd881a9c7c25cbcd","source":{"kind":"arxiv","id":"1505.02637","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1505.02637","created_at":"2026-05-18T02:16:11Z"},{"alias_kind":"arxiv_version","alias_value":"1505.02637v1","created_at":"2026-05-18T02:16:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1505.02637","created_at":"2026-05-18T02:16:11Z"},{"alias_kind":"pith_short_12","alias_value":"HB6MDLKQXX4Y","created_at":"2026-05-18T12:29:22Z"},{"alias_kind":"pith_short_16","alias_value":"HB6MDLKQXX4YWN6X","created_at":"2026-05-18T12:29:22Z"},{"alias_kind":"pith_short_8","alias_value":"HB6MDLKQ","created_at":"2026-05-18T12:29:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:HB6MDLKQXX4YWN6XS6S4HU4GKY","target":"record","payload":{"canonical_record":{"source":{"id":"1505.02637","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2015-05-11T14:28:51Z","cross_cats_sorted":[],"title_canon_sha256":"3923b5f6e9d16becd52729a297940f395a706db0c4a3631372198b46eccac9d3","abstract_canon_sha256":"8f807305066f6dfd4c7ff1c94a87bf7921e81e53d2e7d3194d408fd9a137569f"},"schema_version":"1.0"},"canonical_sha256":"387cc1ad50bdf98b37d797a5c3d386563004273f9e4d4921bd881a9c7c25cbcd","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:16:11.992788Z","signature_b64":"XG9+lg6IqTx9CEcoetgQXF1tXYkTm+69S3VPDGy+nmTeB23vmKAFWCqKR/ps3SwF2v3w5uEx4cZYq0oG6CCkAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"387cc1ad50bdf98b37d797a5c3d386563004273f9e4d4921bd881a9c7c25cbcd","last_reissued_at":"2026-05-18T02:16:11.992212Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:16:11.992212Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1505.02637","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:16:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Luf6Tg7LEpPpsknLtULZGkdXU+AoF8QQU4mZZjXaVgZgQbVVO//s+ugh23JWqt0dTFURtOUy2BsDNzONvHu2CA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-29T22:47:42.365296Z"},"content_sha256":"931c66694c19cdf9b8d3d2df93dcaaa9b5001a6c54aef6fc755d7c955813c5d3","schema_version":"1.0","event_id":"sha256:931c66694c19cdf9b8d3d2df93dcaaa9b5001a6c54aef6fc755d7c955813c5d3"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:HB6MDLKQXX4YWN6XS6S4HU4GKY","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Unbounded-Thread Reachability via Symbolic Execution and Loop Acceleration (Technical Report)","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Peizun Liu, Thomas Wahl","submitted_at":"2015-05-11T14:28:51Z","abstract_excerpt":"We present an approach to parameterized reachability for communicating finite-state threads that formulates the analysis as a satisfiability problem. In addition to the unbounded number of threads, the main challenge for SAT/SMT-based reachability methods is the existence of unbounded loops in the program executed by a thread. We show in this paper how simple loops can be accelerated without approximation into Presburger arithmetic constraints. The constraints are obtained via symbolic execution and are satisfiable exactly if the given program state is reachable. We summarize loops nested insi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1505.02637","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:16:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vEonDz5+gNENmFomIeEvD6Ru7Fowk20I/eI59DheR0opHrmNSoH1QNUKsI/NO5/c2sCpyfuSfoRzIVAultgUDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-29T22:47:42.365748Z"},"content_sha256":"a1d2e5fe076860c00fa109ce47029dbe55c5994fe0eb1031f517681547f8120c","schema_version":"1.0","event_id":"sha256:a1d2e5fe076860c00fa109ce47029dbe55c5994fe0eb1031f517681547f8120c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HB6MDLKQXX4YWN6XS6S4HU4GKY/bundle.json","state_url":"https://pith.science/pith/HB6MDLKQXX4YWN6XS6S4HU4GKY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HB6MDLKQXX4YWN6XS6S4HU4GKY/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-29T22:47:42Z","links":{"resolver":"https://pith.science/pith/HB6MDLKQXX4YWN6XS6S4HU4GKY","bundle":"https://pith.science/pith/HB6MDLKQXX4YWN6XS6S4HU4GKY/bundle.json","state":"https://pith.science/pith/HB6MDLKQXX4YWN6XS6S4HU4GKY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HB6MDLKQXX4YWN6XS6S4HU4GKY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:HB6MDLKQXX4YWN6XS6S4HU4GKY","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":"8f807305066f6dfd4c7ff1c94a87bf7921e81e53d2e7d3194d408fd9a137569f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2015-05-11T14:28:51Z","title_canon_sha256":"3923b5f6e9d16becd52729a297940f395a706db0c4a3631372198b46eccac9d3"},"schema_version":"1.0","source":{"id":"1505.02637","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1505.02637","created_at":"2026-05-18T02:16:11Z"},{"alias_kind":"arxiv_version","alias_value":"1505.02637v1","created_at":"2026-05-18T02:16:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1505.02637","created_at":"2026-05-18T02:16:11Z"},{"alias_kind":"pith_short_12","alias_value":"HB6MDLKQXX4Y","created_at":"2026-05-18T12:29:22Z"},{"alias_kind":"pith_short_16","alias_value":"HB6MDLKQXX4YWN6X","created_at":"2026-05-18T12:29:22Z"},{"alias_kind":"pith_short_8","alias_value":"HB6MDLKQ","created_at":"2026-05-18T12:29:22Z"}],"graph_snapshots":[{"event_id":"sha256:a1d2e5fe076860c00fa109ce47029dbe55c5994fe0eb1031f517681547f8120c","target":"graph","created_at":"2026-05-18T02:16:11Z","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 present an approach to parameterized reachability for communicating finite-state threads that formulates the analysis as a satisfiability problem. In addition to the unbounded number of threads, the main challenge for SAT/SMT-based reachability methods is the existence of unbounded loops in the program executed by a thread. We show in this paper how simple loops can be accelerated without approximation into Presburger arithmetic constraints. The constraints are obtained via symbolic execution and are satisfiable exactly if the given program state is reachable. We summarize loops nested insi","authors_text":"Peizun Liu, Thomas Wahl","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2015-05-11T14:28:51Z","title":"Unbounded-Thread Reachability via Symbolic Execution and Loop Acceleration (Technical Report)"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1505.02637","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:931c66694c19cdf9b8d3d2df93dcaaa9b5001a6c54aef6fc755d7c955813c5d3","target":"record","created_at":"2026-05-18T02:16:11Z","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":"8f807305066f6dfd4c7ff1c94a87bf7921e81e53d2e7d3194d408fd9a137569f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2015-05-11T14:28:51Z","title_canon_sha256":"3923b5f6e9d16becd52729a297940f395a706db0c4a3631372198b46eccac9d3"},"schema_version":"1.0","source":{"id":"1505.02637","kind":"arxiv","version":1}},"canonical_sha256":"387cc1ad50bdf98b37d797a5c3d386563004273f9e4d4921bd881a9c7c25cbcd","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"387cc1ad50bdf98b37d797a5c3d386563004273f9e4d4921bd881a9c7c25cbcd","first_computed_at":"2026-05-18T02:16:11.992212Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:16:11.992212Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"XG9+lg6IqTx9CEcoetgQXF1tXYkTm+69S3VPDGy+nmTeB23vmKAFWCqKR/ps3SwF2v3w5uEx4cZYq0oG6CCkAw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:16:11.992788Z","signed_message":"canonical_sha256_bytes"},"source_id":"1505.02637","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:931c66694c19cdf9b8d3d2df93dcaaa9b5001a6c54aef6fc755d7c955813c5d3","sha256:a1d2e5fe076860c00fa109ce47029dbe55c5994fe0eb1031f517681547f8120c"],"state_sha256":"6e60dfbc70aacb99455846240a59d1cbdeeb04e9e1af0422691b889cd956c10b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YMPlJL4eQwZG/qxgaIe/BkUxDW4iL+l7hnyTC60NSHGVioQ8J/Yz/PMuD9KZFvKBUV0E5/IvhTiKLFenQ269BA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-29T22:47:42.367647Z","bundle_sha256":"f9025a0d0d7955c2c7fee35a8442f01a974d942c9817d5e79f6341cf316c5121"}}