{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:E4NCLHROM5I5QURHWW7ZL442TS","short_pith_number":"pith:E4NCLHRO","canonical_record":{"source":{"id":"1802.06492","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2018-02-19T02:05:54Z","cross_cats_sorted":["cs.SE","cs.SI"],"title_canon_sha256":"51d0d0e95218e1bbca4aebf7e8dc35a5d6b1c495c69869b97e46ac60c3ac973b","abstract_canon_sha256":"559dadad0a5076032ecf4366dc30874d7b155b7032dc0fd073d4a44ffae3d702"},"schema_version":"1.0"},"canonical_sha256":"271a259e2e6751d85227b5bf95f39a9cb43e43700611f7e1e52ac316125be640","source":{"kind":"arxiv","id":"1802.06492","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1802.06492","created_at":"2026-05-18T00:23:03Z"},{"alias_kind":"arxiv_version","alias_value":"1802.06492v1","created_at":"2026-05-18T00:23:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.06492","created_at":"2026-05-18T00:23:03Z"},{"alias_kind":"pith_short_12","alias_value":"E4NCLHROM5I5","created_at":"2026-05-18T12:32:19Z"},{"alias_kind":"pith_short_16","alias_value":"E4NCLHROM5I5QURH","created_at":"2026-05-18T12:32:19Z"},{"alias_kind":"pith_short_8","alias_value":"E4NCLHRO","created_at":"2026-05-18T12:32:19Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:E4NCLHROM5I5QURHWW7ZL442TS","target":"record","payload":{"canonical_record":{"source":{"id":"1802.06492","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2018-02-19T02:05:54Z","cross_cats_sorted":["cs.SE","cs.SI"],"title_canon_sha256":"51d0d0e95218e1bbca4aebf7e8dc35a5d6b1c495c69869b97e46ac60c3ac973b","abstract_canon_sha256":"559dadad0a5076032ecf4366dc30874d7b155b7032dc0fd073d4a44ffae3d702"},"schema_version":"1.0"},"canonical_sha256":"271a259e2e6751d85227b5bf95f39a9cb43e43700611f7e1e52ac316125be640","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:23:03.131297Z","signature_b64":"k04/s7EavYRNaGr7WHO+yrjSvPnY9P/gwIZ2g0FWPgvke5aGaC1XNfrcd+hbGIdzOSO7Q09yM4wfQSk5/SPkCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"271a259e2e6751d85227b5bf95f39a9cb43e43700611f7e1e52ac316125be640","last_reissued_at":"2026-05-18T00:23:03.130640Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:23:03.130640Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1802.06492","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:23:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1nn/nVctLjJXm4ZRrkMWSXuVfTjfAQtqq99PJAkwvIRNskj3rdSDKmbdl4PyyEux5QpqZJvz1jBd3zP8E+UeCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T16:06:22.615473Z"},"content_sha256":"33ea1956bd8486d44a95a19f1f43b3a622f8f84cee553dd971cce77f5f3be7e1","schema_version":"1.0","event_id":"sha256:33ea1956bd8486d44a95a19f1f43b3a622f8f84cee553dd971cce77f5f3be7e1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:E4NCLHROM5I5QURHWW7ZL442TS","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Attributed Hierarchical Port Graphs and Applications","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SE","cs.SI"],"primary_cat":"cs.LO","authors_text":"Bruno Pinaud (University of Bordeaux, France), LaBRI UMR CNRS 5800, Maribel Fern\\'andez (King's College London Dept. of Informatics), Nneka Chinelo Ene (King's College London Dept. of Informatics)","submitted_at":"2018-02-19T02:05:54Z","abstract_excerpt":"We present attributed hierarchical port graphs (AHP) as an extension of port graphs that aims at facilitating the design of modular port graph models for complex systems. AHP consist of a number of interconnected layers, where each layer defines a port graph whose nodes may link to layers further down the hierarchy; attributes are used to store user-defined data as well as visualisation and run-time system parameters.  We also generalise the notion of strategic port graph rewriting (a particular kind of graph transformation system, where port graph rewriting rules are controlled by user-define"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.06492","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:23:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7nbBmOBczs1a26RJW/wp6Rnwv5QqciVV9cCyZ2FFHwnjuwvLHZmfVb0Tygib4S+VhV78hqTrMmYW/mUREBpwBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T16:06:22.615886Z"},"content_sha256":"b3f5b90935cbf5100af0a29f4448caeba74f093de7e49bdc02ead7647b3996dd","schema_version":"1.0","event_id":"sha256:b3f5b90935cbf5100af0a29f4448caeba74f093de7e49bdc02ead7647b3996dd"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/E4NCLHROM5I5QURHWW7ZL442TS/bundle.json","state_url":"https://pith.science/pith/E4NCLHROM5I5QURHWW7ZL442TS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/E4NCLHROM5I5QURHWW7ZL442TS/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-09T16:06:22Z","links":{"resolver":"https://pith.science/pith/E4NCLHROM5I5QURHWW7ZL442TS","bundle":"https://pith.science/pith/E4NCLHROM5I5QURHWW7ZL442TS/bundle.json","state":"https://pith.science/pith/E4NCLHROM5I5QURHWW7ZL442TS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/E4NCLHROM5I5QURHWW7ZL442TS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:E4NCLHROM5I5QURHWW7ZL442TS","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":"559dadad0a5076032ecf4366dc30874d7b155b7032dc0fd073d4a44ffae3d702","cross_cats_sorted":["cs.SE","cs.SI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2018-02-19T02:05:54Z","title_canon_sha256":"51d0d0e95218e1bbca4aebf7e8dc35a5d6b1c495c69869b97e46ac60c3ac973b"},"schema_version":"1.0","source":{"id":"1802.06492","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1802.06492","created_at":"2026-05-18T00:23:03Z"},{"alias_kind":"arxiv_version","alias_value":"1802.06492v1","created_at":"2026-05-18T00:23:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.06492","created_at":"2026-05-18T00:23:03Z"},{"alias_kind":"pith_short_12","alias_value":"E4NCLHROM5I5","created_at":"2026-05-18T12:32:19Z"},{"alias_kind":"pith_short_16","alias_value":"E4NCLHROM5I5QURH","created_at":"2026-05-18T12:32:19Z"},{"alias_kind":"pith_short_8","alias_value":"E4NCLHRO","created_at":"2026-05-18T12:32:19Z"}],"graph_snapshots":[{"event_id":"sha256:b3f5b90935cbf5100af0a29f4448caeba74f093de7e49bdc02ead7647b3996dd","target":"graph","created_at":"2026-05-18T00:23:03Z","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 attributed hierarchical port graphs (AHP) as an extension of port graphs that aims at facilitating the design of modular port graph models for complex systems. AHP consist of a number of interconnected layers, where each layer defines a port graph whose nodes may link to layers further down the hierarchy; attributes are used to store user-defined data as well as visualisation and run-time system parameters.  We also generalise the notion of strategic port graph rewriting (a particular kind of graph transformation system, where port graph rewriting rules are controlled by user-define","authors_text":"Bruno Pinaud (University of Bordeaux, France), LaBRI UMR CNRS 5800, Maribel Fern\\'andez (King's College London Dept. of Informatics), Nneka Chinelo Ene (King's College London Dept. of Informatics)","cross_cats":["cs.SE","cs.SI"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2018-02-19T02:05:54Z","title":"Attributed Hierarchical Port Graphs and Applications"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.06492","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:33ea1956bd8486d44a95a19f1f43b3a622f8f84cee553dd971cce77f5f3be7e1","target":"record","created_at":"2026-05-18T00:23:03Z","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":"559dadad0a5076032ecf4366dc30874d7b155b7032dc0fd073d4a44ffae3d702","cross_cats_sorted":["cs.SE","cs.SI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2018-02-19T02:05:54Z","title_canon_sha256":"51d0d0e95218e1bbca4aebf7e8dc35a5d6b1c495c69869b97e46ac60c3ac973b"},"schema_version":"1.0","source":{"id":"1802.06492","kind":"arxiv","version":1}},"canonical_sha256":"271a259e2e6751d85227b5bf95f39a9cb43e43700611f7e1e52ac316125be640","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"271a259e2e6751d85227b5bf95f39a9cb43e43700611f7e1e52ac316125be640","first_computed_at":"2026-05-18T00:23:03.130640Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:23:03.130640Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"k04/s7EavYRNaGr7WHO+yrjSvPnY9P/gwIZ2g0FWPgvke5aGaC1XNfrcd+hbGIdzOSO7Q09yM4wfQSk5/SPkCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:23:03.131297Z","signed_message":"canonical_sha256_bytes"},"source_id":"1802.06492","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:33ea1956bd8486d44a95a19f1f43b3a622f8f84cee553dd971cce77f5f3be7e1","sha256:b3f5b90935cbf5100af0a29f4448caeba74f093de7e49bdc02ead7647b3996dd"],"state_sha256":"926566b412b9bd575ea7b0895b7092d2ab3c4bc76b53a5a0bdea2f72deca7e50"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LFuKrVHRLxsrnFen4ocAuAniCfJY7vOVrSy7IHKUbWUwgYQ4wXKA+hsQXYfX3zjrz+MFD5Kd15sbhSJQ7RdnAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T16:06:22.618087Z","bundle_sha256":"595be9eb3f53293d6f2cc3141d076ddeadcf887acb3908c61675a8f5b29110f6"}}