{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:3II4A52HM7MPHMXXKSIOKBNSKS","short_pith_number":"pith:3II4A52H","canonical_record":{"source":{"id":"1412.1042","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2014-12-01T08:52:16Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"c26a19eb8e12f1ed0a30b1b83edda70e10e777a2716c65f0e3663922b7620d1f","abstract_canon_sha256":"ddc2969b3909bfaf51f0b66cef5f7ec93f369db5137a9861ae0a73155076b526"},"schema_version":"1.0"},"canonical_sha256":"da11c0774767d8f3b2f75490e505b25491dbe5846021862120b7778017d2fac2","source":{"kind":"arxiv","id":"1412.1042","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1412.1042","created_at":"2026-05-17T23:40:50Z"},{"alias_kind":"arxiv_version","alias_value":"1412.1042v2","created_at":"2026-05-17T23:40:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1412.1042","created_at":"2026-05-17T23:40:50Z"},{"alias_kind":"pith_short_12","alias_value":"3II4A52HM7MP","created_at":"2026-05-18T12:28:11Z"},{"alias_kind":"pith_short_16","alias_value":"3II4A52HM7MPHMXX","created_at":"2026-05-18T12:28:11Z"},{"alias_kind":"pith_short_8","alias_value":"3II4A52H","created_at":"2026-05-18T12:28:11Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:3II4A52HM7MPHMXXKSIOKBNSKS","target":"record","payload":{"canonical_record":{"source":{"id":"1412.1042","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2014-12-01T08:52:16Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"c26a19eb8e12f1ed0a30b1b83edda70e10e777a2716c65f0e3663922b7620d1f","abstract_canon_sha256":"ddc2969b3909bfaf51f0b66cef5f7ec93f369db5137a9861ae0a73155076b526"},"schema_version":"1.0"},"canonical_sha256":"da11c0774767d8f3b2f75490e505b25491dbe5846021862120b7778017d2fac2","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:40:50.173052Z","signature_b64":"+WrDp+Gq1YMKJGMXFcgtDtB0vkidng+GMeCaHau5eImgy6ZR2iW58RptHBfLRedmeFMj3PYt7P8Qftqv3CrUAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"da11c0774767d8f3b2f75490e505b25491dbe5846021862120b7778017d2fac2","last_reissued_at":"2026-05-17T23:40:50.172300Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:40:50.172300Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1412.1042","source_version":2,"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-17T23:40:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Hfi7fjMN5KczGyD4+lM4+IKALCDAwEW+zyv8B4oxFppZS9N4D+JrOA+dS5IYlTKR1bJpRJgPCjGsX4VuOm16Dw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T20:24:33.213729Z"},"content_sha256":"66b213ce2a9589cb42bf6a0068e1ee7092595f6cd59ecd8fc1b4a87f73d93396","schema_version":"1.0","event_id":"sha256:66b213ce2a9589cb42bf6a0068e1ee7092595f6cd59ecd8fc1b4a87f73d93396"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:3II4A52HM7MPHMXXKSIOKBNSKS","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A CSP implementation of the bigraph embedding problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LO","authors_text":"Marco Peressotti, Marino Miculan","submitted_at":"2014-12-01T08:52:16Z","abstract_excerpt":"A crucial problem for many results and tools about bigraphs and bigraphical reactive systems is bigraph embedding. An embedding is more informative than a bigraph matching, since it keeps track of the correspondence between the various components of the redex (guest) within the agent (host). In this paper, we present an algorithm for computing embeddings based on a reduction to a constraint satisfaction problem. This algorithm, that we prove to be sound and complete, has been successfully implemented in LibBig, a library for manipulating bigraphical reactive systems. This library can be used f"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1412.1042","kind":"arxiv","version":2},"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-17T23:40:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Cv/qLFxDTuIAtwXjMYjEHSFefO206WtpGCLPymoEZGfmGjwSR3TxL74BztXPmMEc3wMKx+AiT0x8sAlUE7vtDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T20:24:33.214076Z"},"content_sha256":"49bd5177fb6674d843e78eb204777ccf3df9ef37325880fa48dea84da1256658","schema_version":"1.0","event_id":"sha256:49bd5177fb6674d843e78eb204777ccf3df9ef37325880fa48dea84da1256658"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3II4A52HM7MPHMXXKSIOKBNSKS/bundle.json","state_url":"https://pith.science/pith/3II4A52HM7MPHMXXKSIOKBNSKS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3II4A52HM7MPHMXXKSIOKBNSKS/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-25T20:24:33Z","links":{"resolver":"https://pith.science/pith/3II4A52HM7MPHMXXKSIOKBNSKS","bundle":"https://pith.science/pith/3II4A52HM7MPHMXXKSIOKBNSKS/bundle.json","state":"https://pith.science/pith/3II4A52HM7MPHMXXKSIOKBNSKS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3II4A52HM7MPHMXXKSIOKBNSKS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:3II4A52HM7MPHMXXKSIOKBNSKS","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":"ddc2969b3909bfaf51f0b66cef5f7ec93f369db5137a9861ae0a73155076b526","cross_cats_sorted":["cs.AI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2014-12-01T08:52:16Z","title_canon_sha256":"c26a19eb8e12f1ed0a30b1b83edda70e10e777a2716c65f0e3663922b7620d1f"},"schema_version":"1.0","source":{"id":"1412.1042","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1412.1042","created_at":"2026-05-17T23:40:50Z"},{"alias_kind":"arxiv_version","alias_value":"1412.1042v2","created_at":"2026-05-17T23:40:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1412.1042","created_at":"2026-05-17T23:40:50Z"},{"alias_kind":"pith_short_12","alias_value":"3II4A52HM7MP","created_at":"2026-05-18T12:28:11Z"},{"alias_kind":"pith_short_16","alias_value":"3II4A52HM7MPHMXX","created_at":"2026-05-18T12:28:11Z"},{"alias_kind":"pith_short_8","alias_value":"3II4A52H","created_at":"2026-05-18T12:28:11Z"}],"graph_snapshots":[{"event_id":"sha256:49bd5177fb6674d843e78eb204777ccf3df9ef37325880fa48dea84da1256658","target":"graph","created_at":"2026-05-17T23:40: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":"A crucial problem for many results and tools about bigraphs and bigraphical reactive systems is bigraph embedding. An embedding is more informative than a bigraph matching, since it keeps track of the correspondence between the various components of the redex (guest) within the agent (host). In this paper, we present an algorithm for computing embeddings based on a reduction to a constraint satisfaction problem. This algorithm, that we prove to be sound and complete, has been successfully implemented in LibBig, a library for manipulating bigraphical reactive systems. This library can be used f","authors_text":"Marco Peressotti, Marino Miculan","cross_cats":["cs.AI"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2014-12-01T08:52:16Z","title":"A CSP implementation of the bigraph embedding problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1412.1042","kind":"arxiv","version":2},"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:66b213ce2a9589cb42bf6a0068e1ee7092595f6cd59ecd8fc1b4a87f73d93396","target":"record","created_at":"2026-05-17T23:40: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":"ddc2969b3909bfaf51f0b66cef5f7ec93f369db5137a9861ae0a73155076b526","cross_cats_sorted":["cs.AI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2014-12-01T08:52:16Z","title_canon_sha256":"c26a19eb8e12f1ed0a30b1b83edda70e10e777a2716c65f0e3663922b7620d1f"},"schema_version":"1.0","source":{"id":"1412.1042","kind":"arxiv","version":2}},"canonical_sha256":"da11c0774767d8f3b2f75490e505b25491dbe5846021862120b7778017d2fac2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"da11c0774767d8f3b2f75490e505b25491dbe5846021862120b7778017d2fac2","first_computed_at":"2026-05-17T23:40:50.172300Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:40:50.172300Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"+WrDp+Gq1YMKJGMXFcgtDtB0vkidng+GMeCaHau5eImgy6ZR2iW58RptHBfLRedmeFMj3PYt7P8Qftqv3CrUAw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:40:50.173052Z","signed_message":"canonical_sha256_bytes"},"source_id":"1412.1042","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:66b213ce2a9589cb42bf6a0068e1ee7092595f6cd59ecd8fc1b4a87f73d93396","sha256:49bd5177fb6674d843e78eb204777ccf3df9ef37325880fa48dea84da1256658"],"state_sha256":"859b2073d8071989bd3b69d8cd7a70756498ab4c9399ec6d2f9412c6f0b7ba93"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"s8vurUnA8FY3U//tiW4JfkKMwZDDZwmSaOjgk5SeUFLJmnHgE+7NH5zpcr3l79uHsvthZfg5SxPJobL20feeDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-25T20:24:33.216074Z","bundle_sha256":"ffe622b5d890b9a22625b10201b68dbb24d93e86a885abb62bf55cf628483ad1"}}