{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:O4VTVGDCJNNBTU3NFAQTLO6FYN","short_pith_number":"pith:O4VTVGDC","canonical_record":{"source":{"id":"1704.03160","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2017-04-11T06:20:05Z","cross_cats_sorted":[],"title_canon_sha256":"284a3759aae09f65495d755f7f8eaa53bb2a91a6c551d0840d0dbfb3d16a6862","abstract_canon_sha256":"1ab6dd2a012180da11902fdde6d7b373b8477cd84b5432ee05da5cec8773b110"},"schema_version":"1.0"},"canonical_sha256":"772b3a98624b5a19d36d282135bbc5c368be1f4d958b20b4714d27d7bc9878a0","source":{"kind":"arxiv","id":"1704.03160","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1704.03160","created_at":"2026-05-18T00:46:33Z"},{"alias_kind":"arxiv_version","alias_value":"1704.03160v1","created_at":"2026-05-18T00:46:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.03160","created_at":"2026-05-18T00:46:33Z"},{"alias_kind":"pith_short_12","alias_value":"O4VTVGDCJNNB","created_at":"2026-05-18T12:31:34Z"},{"alias_kind":"pith_short_16","alias_value":"O4VTVGDCJNNBTU3N","created_at":"2026-05-18T12:31:34Z"},{"alias_kind":"pith_short_8","alias_value":"O4VTVGDC","created_at":"2026-05-18T12:31:34Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:O4VTVGDCJNNBTU3NFAQTLO6FYN","target":"record","payload":{"canonical_record":{"source":{"id":"1704.03160","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2017-04-11T06:20:05Z","cross_cats_sorted":[],"title_canon_sha256":"284a3759aae09f65495d755f7f8eaa53bb2a91a6c551d0840d0dbfb3d16a6862","abstract_canon_sha256":"1ab6dd2a012180da11902fdde6d7b373b8477cd84b5432ee05da5cec8773b110"},"schema_version":"1.0"},"canonical_sha256":"772b3a98624b5a19d36d282135bbc5c368be1f4d958b20b4714d27d7bc9878a0","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:46:33.366680Z","signature_b64":"aWMTkHKQBTmcb/zRzRMPTY9eL5vZVVKWubpR+wln2/EAp+icumcQu5qEeCsZPS3jYZCj/AZ6I14ypRQAX6+QCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"772b3a98624b5a19d36d282135bbc5c368be1f4d958b20b4714d27d7bc9878a0","last_reissued_at":"2026-05-18T00:46:33.365923Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:46:33.365923Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1704.03160","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:46:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Gpxfp97kyVwecVMXpPodOD6UMnFOLqhB9YgmzhOwnfCcDSK4bhAP9Odt0H8FtsMkFshCSh7Z1zdJ/i/B7k7uAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T22:16:38.798679Z"},"content_sha256":"91701219dc5e9a336f16f3087188853c492b100d5423856bf66111cf85040f03","schema_version":"1.0","event_id":"sha256:91701219dc5e9a336f16f3087188853c492b100d5423856bf66111cf85040f03"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:O4VTVGDCJNNBTU3NFAQTLO6FYN","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Lean and Full Congruence Formats for Recursion","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Rob van Glabbeek","submitted_at":"2017-04-11T06:20:05Z","abstract_excerpt":"In this paper I distinguish two (pre)congruence requirements for semantic equivalences and preorders on processes given as closed terms in a system description language with a recursion construct. A lean congruence preserves equivalence when replacing closed subexpressions of a process by equivalent alternatives. A full congruence moreover allows replacement within a recursive specification of subexpressions that may contain recursion variables bound outside of these subexpressions.\n  I establish that bisimilarity is a lean (pre)congruence for recursion for all languages with a structural oper"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1704.03160","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:46:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rJnsDR1s2VE+FEMqRcT2kahemnsny6QIHgziXZ8shNGHACUF88MckJx7phbz1JTm5ciSvaJt7h5veflV2m1yAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T22:16:38.799338Z"},"content_sha256":"86ffa4b39eeacab4acfe531ebbf0478170ad5525462171a072a94b74f9928a2f","schema_version":"1.0","event_id":"sha256:86ffa4b39eeacab4acfe531ebbf0478170ad5525462171a072a94b74f9928a2f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/O4VTVGDCJNNBTU3NFAQTLO6FYN/bundle.json","state_url":"https://pith.science/pith/O4VTVGDCJNNBTU3NFAQTLO6FYN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/O4VTVGDCJNNBTU3NFAQTLO6FYN/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-05-27T22:16:38Z","links":{"resolver":"https://pith.science/pith/O4VTVGDCJNNBTU3NFAQTLO6FYN","bundle":"https://pith.science/pith/O4VTVGDCJNNBTU3NFAQTLO6FYN/bundle.json","state":"https://pith.science/pith/O4VTVGDCJNNBTU3NFAQTLO6FYN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/O4VTVGDCJNNBTU3NFAQTLO6FYN/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:O4VTVGDCJNNBTU3NFAQTLO6FYN","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":"1ab6dd2a012180da11902fdde6d7b373b8477cd84b5432ee05da5cec8773b110","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2017-04-11T06:20:05Z","title_canon_sha256":"284a3759aae09f65495d755f7f8eaa53bb2a91a6c551d0840d0dbfb3d16a6862"},"schema_version":"1.0","source":{"id":"1704.03160","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1704.03160","created_at":"2026-05-18T00:46:33Z"},{"alias_kind":"arxiv_version","alias_value":"1704.03160v1","created_at":"2026-05-18T00:46:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.03160","created_at":"2026-05-18T00:46:33Z"},{"alias_kind":"pith_short_12","alias_value":"O4VTVGDCJNNB","created_at":"2026-05-18T12:31:34Z"},{"alias_kind":"pith_short_16","alias_value":"O4VTVGDCJNNBTU3N","created_at":"2026-05-18T12:31:34Z"},{"alias_kind":"pith_short_8","alias_value":"O4VTVGDC","created_at":"2026-05-18T12:31:34Z"}],"graph_snapshots":[{"event_id":"sha256:86ffa4b39eeacab4acfe531ebbf0478170ad5525462171a072a94b74f9928a2f","target":"graph","created_at":"2026-05-18T00:46:33Z","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":"In this paper I distinguish two (pre)congruence requirements for semantic equivalences and preorders on processes given as closed terms in a system description language with a recursion construct. A lean congruence preserves equivalence when replacing closed subexpressions of a process by equivalent alternatives. A full congruence moreover allows replacement within a recursive specification of subexpressions that may contain recursion variables bound outside of these subexpressions.\n  I establish that bisimilarity is a lean (pre)congruence for recursion for all languages with a structural oper","authors_text":"Rob van Glabbeek","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2017-04-11T06:20:05Z","title":"Lean and Full Congruence Formats for Recursion"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1704.03160","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:91701219dc5e9a336f16f3087188853c492b100d5423856bf66111cf85040f03","target":"record","created_at":"2026-05-18T00:46:33Z","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":"1ab6dd2a012180da11902fdde6d7b373b8477cd84b5432ee05da5cec8773b110","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2017-04-11T06:20:05Z","title_canon_sha256":"284a3759aae09f65495d755f7f8eaa53bb2a91a6c551d0840d0dbfb3d16a6862"},"schema_version":"1.0","source":{"id":"1704.03160","kind":"arxiv","version":1}},"canonical_sha256":"772b3a98624b5a19d36d282135bbc5c368be1f4d958b20b4714d27d7bc9878a0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"772b3a98624b5a19d36d282135bbc5c368be1f4d958b20b4714d27d7bc9878a0","first_computed_at":"2026-05-18T00:46:33.365923Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:46:33.365923Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"aWMTkHKQBTmcb/zRzRMPTY9eL5vZVVKWubpR+wln2/EAp+icumcQu5qEeCsZPS3jYZCj/AZ6I14ypRQAX6+QCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:46:33.366680Z","signed_message":"canonical_sha256_bytes"},"source_id":"1704.03160","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:91701219dc5e9a336f16f3087188853c492b100d5423856bf66111cf85040f03","sha256:86ffa4b39eeacab4acfe531ebbf0478170ad5525462171a072a94b74f9928a2f"],"state_sha256":"6f3cae8782d28f56f66b02cae5bb081a080f0fe8382d89f92f8e9e5e57014303"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vwYyZ0i+DJAaqYSAIO2ZpOBud2OnqXRJ5+J9LhlpXLpYjhnWuY/6mtafzFR80QYp3LLQHEQcGDhdqAnBhyYdDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T22:16:38.802600Z","bundle_sha256":"5b86dd286a650b921c9e3984dea0506043ff3225d7836b04aecb81823a4257aa"}}