{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:5C525S4ZDTQHSXSW7XRBNGJJVO","short_pith_number":"pith:5C525S4Z","canonical_record":{"source":{"id":"1504.03474","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2015-04-14T09:56:21Z","cross_cats_sorted":["cs.SE"],"title_canon_sha256":"cfdaea0036426805f863998fea75f47db63147c05aabfbaad7aac1870993db87","abstract_canon_sha256":"eb67fae11acebf29ddc2398eacff90ce6ca8e1c6833264f1614ed70ffda6cabb"},"schema_version":"1.0"},"canonical_sha256":"e8bbaecb991ce0795e56fde2169929ab8249683408c45bc0f92745b7b87bb4b0","source":{"kind":"arxiv","id":"1504.03474","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1504.03474","created_at":"2026-05-18T02:18:50Z"},{"alias_kind":"arxiv_version","alias_value":"1504.03474v1","created_at":"2026-05-18T02:18:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.03474","created_at":"2026-05-18T02:18:50Z"},{"alias_kind":"pith_short_12","alias_value":"5C525S4ZDTQH","created_at":"2026-05-18T12:29:05Z"},{"alias_kind":"pith_short_16","alias_value":"5C525S4ZDTQHSXSW","created_at":"2026-05-18T12:29:05Z"},{"alias_kind":"pith_short_8","alias_value":"5C525S4Z","created_at":"2026-05-18T12:29:05Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:5C525S4ZDTQHSXSW7XRBNGJJVO","target":"record","payload":{"canonical_record":{"source":{"id":"1504.03474","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2015-04-14T09:56:21Z","cross_cats_sorted":["cs.SE"],"title_canon_sha256":"cfdaea0036426805f863998fea75f47db63147c05aabfbaad7aac1870993db87","abstract_canon_sha256":"eb67fae11acebf29ddc2398eacff90ce6ca8e1c6833264f1614ed70ffda6cabb"},"schema_version":"1.0"},"canonical_sha256":"e8bbaecb991ce0795e56fde2169929ab8249683408c45bc0f92745b7b87bb4b0","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:18:50.823088Z","signature_b64":"LXwbyeC3s72dc1sfI/4TXPNeaSw0SCPhS9Ek1Uoa79WSf6asS7mCzoPXx3wYpF0e9I6yaqgj+FHYu0rB9MnoDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e8bbaecb991ce0795e56fde2169929ab8249683408c45bc0f92745b7b87bb4b0","last_reissued_at":"2026-05-18T02:18:50.822414Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:18:50.822414Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1504.03474","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:18:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pjH+yIlcqDD89PnartjNl/dsZiMA1Ir8a33KMXnfmT+X+S80lGuzJvmjBavc7O6r2rqKZOF/pymmwW5XUJsNBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T02:49:24.452055Z"},"content_sha256":"13fff59312222fc78915b96658f33f326d413e179801806010a2beb2005bf2e5","schema_version":"1.0","event_id":"sha256:13fff59312222fc78915b96658f33f326d413e179801806010a2beb2005bf2e5"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:5C525S4ZDTQHSXSW7XRBNGJJVO","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Coherent branching feature bisimulation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SE"],"primary_cat":"cs.LO","authors_text":"Amsterdam, CWI, Eindhoven, Erik P. de Vink (TU/e, Italy), Maurice H. ter Beek (ISTI-CNR, Pisa, Tessa Belder (TU/e, the Netherlands)","submitted_at":"2015-04-14T09:56:21Z","abstract_excerpt":"Progress in the behavioral analysis of software product lines at the family level benefits from further development of the underlying semantical theory. Here, we propose a behavioral equivalence for feature transition systems (FTS) generalizing branching bisimulation for labeled transition systems (LTS). We prove that branching feature bisimulation for an FTS of a family of products coincides with branching bisimulation for the LTS projection of each the individual products. For a restricted notion of coherent branching feature bisimulation we furthermore present a minimization algorithm and s"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1504.03474","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:18:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8odAXAZa5HZ6mfGhj/iSQQh92B6Lk/WKEAuw5WhSxxSZfUr44JCgbWkB/4wRMsE9fq44pgXAJI56vHIxoejQDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T02:49:24.452692Z"},"content_sha256":"ca3197e70a3f17963f51ec9dac55db56c6211794ef9df6eb5a29543967d402f9","schema_version":"1.0","event_id":"sha256:ca3197e70a3f17963f51ec9dac55db56c6211794ef9df6eb5a29543967d402f9"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5C525S4ZDTQHSXSW7XRBNGJJVO/bundle.json","state_url":"https://pith.science/pith/5C525S4ZDTQHSXSW7XRBNGJJVO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5C525S4ZDTQHSXSW7XRBNGJJVO/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-06T02:49:24Z","links":{"resolver":"https://pith.science/pith/5C525S4ZDTQHSXSW7XRBNGJJVO","bundle":"https://pith.science/pith/5C525S4ZDTQHSXSW7XRBNGJJVO/bundle.json","state":"https://pith.science/pith/5C525S4ZDTQHSXSW7XRBNGJJVO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5C525S4ZDTQHSXSW7XRBNGJJVO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:5C525S4ZDTQHSXSW7XRBNGJJVO","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":"eb67fae11acebf29ddc2398eacff90ce6ca8e1c6833264f1614ed70ffda6cabb","cross_cats_sorted":["cs.SE"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2015-04-14T09:56:21Z","title_canon_sha256":"cfdaea0036426805f863998fea75f47db63147c05aabfbaad7aac1870993db87"},"schema_version":"1.0","source":{"id":"1504.03474","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1504.03474","created_at":"2026-05-18T02:18:50Z"},{"alias_kind":"arxiv_version","alias_value":"1504.03474v1","created_at":"2026-05-18T02:18:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.03474","created_at":"2026-05-18T02:18:50Z"},{"alias_kind":"pith_short_12","alias_value":"5C525S4ZDTQH","created_at":"2026-05-18T12:29:05Z"},{"alias_kind":"pith_short_16","alias_value":"5C525S4ZDTQHSXSW","created_at":"2026-05-18T12:29:05Z"},{"alias_kind":"pith_short_8","alias_value":"5C525S4Z","created_at":"2026-05-18T12:29:05Z"}],"graph_snapshots":[{"event_id":"sha256:ca3197e70a3f17963f51ec9dac55db56c6211794ef9df6eb5a29543967d402f9","target":"graph","created_at":"2026-05-18T02:18:50Z","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":"Progress in the behavioral analysis of software product lines at the family level benefits from further development of the underlying semantical theory. Here, we propose a behavioral equivalence for feature transition systems (FTS) generalizing branching bisimulation for labeled transition systems (LTS). We prove that branching feature bisimulation for an FTS of a family of products coincides with branching bisimulation for the LTS projection of each the individual products. For a restricted notion of coherent branching feature bisimulation we furthermore present a minimization algorithm and s","authors_text":"Amsterdam, CWI, Eindhoven, Erik P. de Vink (TU/e, Italy), Maurice H. ter Beek (ISTI-CNR, Pisa, Tessa Belder (TU/e, the Netherlands)","cross_cats":["cs.SE"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2015-04-14T09:56:21Z","title":"Coherent branching feature bisimulation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1504.03474","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:13fff59312222fc78915b96658f33f326d413e179801806010a2beb2005bf2e5","target":"record","created_at":"2026-05-18T02:18:50Z","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":"eb67fae11acebf29ddc2398eacff90ce6ca8e1c6833264f1614ed70ffda6cabb","cross_cats_sorted":["cs.SE"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2015-04-14T09:56:21Z","title_canon_sha256":"cfdaea0036426805f863998fea75f47db63147c05aabfbaad7aac1870993db87"},"schema_version":"1.0","source":{"id":"1504.03474","kind":"arxiv","version":1}},"canonical_sha256":"e8bbaecb991ce0795e56fde2169929ab8249683408c45bc0f92745b7b87bb4b0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e8bbaecb991ce0795e56fde2169929ab8249683408c45bc0f92745b7b87bb4b0","first_computed_at":"2026-05-18T02:18:50.822414Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:18:50.822414Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"LXwbyeC3s72dc1sfI/4TXPNeaSw0SCPhS9Ek1Uoa79WSf6asS7mCzoPXx3wYpF0e9I6yaqgj+FHYu0rB9MnoDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:18:50.823088Z","signed_message":"canonical_sha256_bytes"},"source_id":"1504.03474","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:13fff59312222fc78915b96658f33f326d413e179801806010a2beb2005bf2e5","sha256:ca3197e70a3f17963f51ec9dac55db56c6211794ef9df6eb5a29543967d402f9"],"state_sha256":"b09e3331b9060f0141779bcbe214d31e5d02b52eebd49e964ea7cc27558d592f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eRqhJ4uyw9ARHZf/4Ad9lLhJK2443RfNF7iPNR06XOP2UNm37BaeUtz/3I8CChF03klh/ixxM1zFbbeLdKkTAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-06T02:49:24.454879Z","bundle_sha256":"f558fec927172101815b67b1026ebe7d7a2f7bcbb2e69e91eec97815fb70fac6"}}