{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:MXXSSXDORH4XSRLC6KBDK25TVE","short_pith_number":"pith:MXXSSXDO","canonical_record":{"source":{"id":"1709.05045","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2017-09-15T03:37:46Z","cross_cats_sorted":["cs.LO"],"title_canon_sha256":"90003f458e4509aba6748f8182a55995d7f694e581f845e7bba23712812b46f9","abstract_canon_sha256":"0c2006367f2a34f9443c954785fe2965ea4e0e1d872d55158e935c84243405fa"},"schema_version":"1.0"},"canonical_sha256":"65ef295c6e89f9794562f282356bb3a91a750bbaa62ba37daa9be5bc3fca9c26","source":{"kind":"arxiv","id":"1709.05045","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1709.05045","created_at":"2026-05-18T00:35:06Z"},{"alias_kind":"arxiv_version","alias_value":"1709.05045v1","created_at":"2026-05-18T00:35:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.05045","created_at":"2026-05-18T00:35:06Z"},{"alias_kind":"pith_short_12","alias_value":"MXXSSXDORH4X","created_at":"2026-05-18T12:31:31Z"},{"alias_kind":"pith_short_16","alias_value":"MXXSSXDORH4XSRLC","created_at":"2026-05-18T12:31:31Z"},{"alias_kind":"pith_short_8","alias_value":"MXXSSXDO","created_at":"2026-05-18T12:31:31Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:MXXSSXDORH4XSRLC6KBDK25TVE","target":"record","payload":{"canonical_record":{"source":{"id":"1709.05045","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2017-09-15T03:37:46Z","cross_cats_sorted":["cs.LO"],"title_canon_sha256":"90003f458e4509aba6748f8182a55995d7f694e581f845e7bba23712812b46f9","abstract_canon_sha256":"0c2006367f2a34f9443c954785fe2965ea4e0e1d872d55158e935c84243405fa"},"schema_version":"1.0"},"canonical_sha256":"65ef295c6e89f9794562f282356bb3a91a750bbaa62ba37daa9be5bc3fca9c26","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:35:06.858345Z","signature_b64":"cTB27hv/IjoSZ8/QIGFTiob7BAaIr+ju/ZBs2ZdXDKpfk/+qOSjGLgqoHWO5P+gGjz1kptIG7tfbiABitv2TDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"65ef295c6e89f9794562f282356bb3a91a750bbaa62ba37daa9be5bc3fca9c26","last_reissued_at":"2026-05-18T00:35:06.857866Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:35:06.857866Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1709.05045","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-18T00:35:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MwQ8cswZkJch4Ua+BSeFukeH63B3C1Ujuv0pR7tth3WJjaF4TJLcW+RW7Lx3A5PAqx+1+2Hqn0ufSfkaRzZhAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-28T16:49:48.974041Z"},"content_sha256":"6e3cb9cbe69a11f24f28de72125e4c2c1acd6300bedb6eb3b61379dba1c38113","schema_version":"1.0","event_id":"sha256:6e3cb9cbe69a11f24f28de72125e4c2c1acd6300bedb6eb3b61379dba1c38113"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:MXXSSXDORH4XSRLC6KBDK25TVE","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Constructor-Based Reachability Logic for Rewrite Theories","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LO"],"primary_cat":"cs.PL","authors_text":"Andrei Stefanescu, Jos\\'e Meseguer, Stephen Skeirik","submitted_at":"2017-09-15T03:37:46Z","abstract_excerpt":"Reachability logic has been applied to $\\mathbb{K}$ rewrite-rule-based language definitions as a language-generic logic of programs. To be able to verify not just code but also distributed system designs, a new rewrite-theory-generic reachability logic is presented and proved sound for a wide class of rewrite theories. The logic's automation is increased by means of constructor-based semantic unification, matching, and satisfiability procedures. New methods for proving invariants of possibly never terminating distributed systems are developed, and experiments with a prototype implementation il"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.05045","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-18T00:35:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yBwEebc1EFio6MvMw3jbvGGcSci72Y+iP5lqQnjlk5jnronFmm/+WU7flEjb6dNJXP2EXTjBGDWE0xrgWolrAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-28T16:49:48.974399Z"},"content_sha256":"613d9df498547ad7a11d318cc00dfba32a18ef53db4048dc93e7a93c2143d3c3","schema_version":"1.0","event_id":"sha256:613d9df498547ad7a11d318cc00dfba32a18ef53db4048dc93e7a93c2143d3c3"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MXXSSXDORH4XSRLC6KBDK25TVE/bundle.json","state_url":"https://pith.science/pith/MXXSSXDORH4XSRLC6KBDK25TVE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MXXSSXDORH4XSRLC6KBDK25TVE/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-28T16:49:48Z","links":{"resolver":"https://pith.science/pith/MXXSSXDORH4XSRLC6KBDK25TVE","bundle":"https://pith.science/pith/MXXSSXDORH4XSRLC6KBDK25TVE/bundle.json","state":"https://pith.science/pith/MXXSSXDORH4XSRLC6KBDK25TVE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MXXSSXDORH4XSRLC6KBDK25TVE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:MXXSSXDORH4XSRLC6KBDK25TVE","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":"0c2006367f2a34f9443c954785fe2965ea4e0e1d872d55158e935c84243405fa","cross_cats_sorted":["cs.LO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2017-09-15T03:37:46Z","title_canon_sha256":"90003f458e4509aba6748f8182a55995d7f694e581f845e7bba23712812b46f9"},"schema_version":"1.0","source":{"id":"1709.05045","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1709.05045","created_at":"2026-05-18T00:35:06Z"},{"alias_kind":"arxiv_version","alias_value":"1709.05045v1","created_at":"2026-05-18T00:35:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.05045","created_at":"2026-05-18T00:35:06Z"},{"alias_kind":"pith_short_12","alias_value":"MXXSSXDORH4X","created_at":"2026-05-18T12:31:31Z"},{"alias_kind":"pith_short_16","alias_value":"MXXSSXDORH4XSRLC","created_at":"2026-05-18T12:31:31Z"},{"alias_kind":"pith_short_8","alias_value":"MXXSSXDO","created_at":"2026-05-18T12:31:31Z"}],"graph_snapshots":[{"event_id":"sha256:613d9df498547ad7a11d318cc00dfba32a18ef53db4048dc93e7a93c2143d3c3","target":"graph","created_at":"2026-05-18T00:35:06Z","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":"Reachability logic has been applied to $\\mathbb{K}$ rewrite-rule-based language definitions as a language-generic logic of programs. To be able to verify not just code but also distributed system designs, a new rewrite-theory-generic reachability logic is presented and proved sound for a wide class of rewrite theories. The logic's automation is increased by means of constructor-based semantic unification, matching, and satisfiability procedures. New methods for proving invariants of possibly never terminating distributed systems are developed, and experiments with a prototype implementation il","authors_text":"Andrei Stefanescu, Jos\\'e Meseguer, Stephen Skeirik","cross_cats":["cs.LO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2017-09-15T03:37:46Z","title":"A Constructor-Based Reachability Logic for Rewrite Theories"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.05045","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:6e3cb9cbe69a11f24f28de72125e4c2c1acd6300bedb6eb3b61379dba1c38113","target":"record","created_at":"2026-05-18T00:35:06Z","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":"0c2006367f2a34f9443c954785fe2965ea4e0e1d872d55158e935c84243405fa","cross_cats_sorted":["cs.LO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2017-09-15T03:37:46Z","title_canon_sha256":"90003f458e4509aba6748f8182a55995d7f694e581f845e7bba23712812b46f9"},"schema_version":"1.0","source":{"id":"1709.05045","kind":"arxiv","version":1}},"canonical_sha256":"65ef295c6e89f9794562f282356bb3a91a750bbaa62ba37daa9be5bc3fca9c26","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"65ef295c6e89f9794562f282356bb3a91a750bbaa62ba37daa9be5bc3fca9c26","first_computed_at":"2026-05-18T00:35:06.857866Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:35:06.857866Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"cTB27hv/IjoSZ8/QIGFTiob7BAaIr+ju/ZBs2ZdXDKpfk/+qOSjGLgqoHWO5P+gGjz1kptIG7tfbiABitv2TDA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:35:06.858345Z","signed_message":"canonical_sha256_bytes"},"source_id":"1709.05045","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6e3cb9cbe69a11f24f28de72125e4c2c1acd6300bedb6eb3b61379dba1c38113","sha256:613d9df498547ad7a11d318cc00dfba32a18ef53db4048dc93e7a93c2143d3c3"],"state_sha256":"a257677597249342324b5643481d95e69dca6bee81388a23ab36b9658b4eb8be"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SFp6h65W2JeR2R/V3hEAoRLBTHbmgDyCl/qQ/nSKarn/VRNafNUmXDbrrkr/2uhTS7zkGq/B0BGoYu4fevzrBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-28T16:49:48.976280Z","bundle_sha256":"342d8356238a8ed3e3562fb7d7a8ef8eed69bd4cc11e115cf8074eafaaac0d8b"}}