{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:FZAGOVPSBI2N7YE7LG2665WDBR","short_pith_number":"pith:FZAGOVPS","canonical_record":{"source":{"id":"1804.06972","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/publicdomain/zero/1.0/","primary_cat":"cs.IT","submitted_at":"2018-04-19T01:56:59Z","cross_cats_sorted":["cs.CC","math.IT"],"title_canon_sha256":"259164fc6dc9c2e678905678b5ec0713f4cba8ac1e22b6472f0d3ea80bab2e25","abstract_canon_sha256":"13f1a111c2b9beeb7155cefa20968e4f5124250796e8909d79a543119841e05c"},"schema_version":"1.0"},"canonical_sha256":"2e406755f20a34dfe09f59b5ef76c30c66c7a45dad2bc4d05deb97360df8e0cc","source":{"kind":"arxiv","id":"1804.06972","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1804.06972","created_at":"2026-05-18T00:18:04Z"},{"alias_kind":"arxiv_version","alias_value":"1804.06972v1","created_at":"2026-05-18T00:18:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.06972","created_at":"2026-05-18T00:18:04Z"},{"alias_kind":"pith_short_12","alias_value":"FZAGOVPSBI2N","created_at":"2026-05-18T12:32:25Z"},{"alias_kind":"pith_short_16","alias_value":"FZAGOVPSBI2N7YE7","created_at":"2026-05-18T12:32:25Z"},{"alias_kind":"pith_short_8","alias_value":"FZAGOVPS","created_at":"2026-05-18T12:32:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:FZAGOVPSBI2N7YE7LG2665WDBR","target":"record","payload":{"canonical_record":{"source":{"id":"1804.06972","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/publicdomain/zero/1.0/","primary_cat":"cs.IT","submitted_at":"2018-04-19T01:56:59Z","cross_cats_sorted":["cs.CC","math.IT"],"title_canon_sha256":"259164fc6dc9c2e678905678b5ec0713f4cba8ac1e22b6472f0d3ea80bab2e25","abstract_canon_sha256":"13f1a111c2b9beeb7155cefa20968e4f5124250796e8909d79a543119841e05c"},"schema_version":"1.0"},"canonical_sha256":"2e406755f20a34dfe09f59b5ef76c30c66c7a45dad2bc4d05deb97360df8e0cc","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:18:04.672774Z","signature_b64":"xfxA4aKRTjHC9jbqkNMrNcfd5OKSSkwAel+e0X2sINSMz6YPdBokyWjHtpc1s+PCNMguw6+gQTGZdsgp/yChBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2e406755f20a34dfe09f59b5ef76c30c66c7a45dad2bc4d05deb97360df8e0cc","last_reissued_at":"2026-05-18T00:18:04.672092Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:18:04.672092Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1804.06972","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:18:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YIq4RyUm5apL+53klEcSy1CKKdDCZXMOXkbDeozEJElnk2WXERkmmng8CzbeqcqtRmX+Di92T72bdBtCtRUHCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-02T23:14:51.517534Z"},"content_sha256":"2f25720a646667930b8f7283cda21c8582ef7d2770ac732a643f131afec1f08d","schema_version":"1.0","event_id":"sha256:2f25720a646667930b8f7283cda21c8582ef7d2770ac732a643f131afec1f08d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:FZAGOVPSBI2N7YE7LG2665WDBR","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Defining Pathway Assembly and Exploring its Applications","license":"http://creativecommons.org/publicdomain/zero/1.0/","headline":"","cross_cats":["cs.CC","math.IT"],"primary_cat":"cs.IT","authors_text":"Alastair Murray, Leroy Cronin, Stuart Marshall","submitted_at":"2018-04-19T01:56:59Z","abstract_excerpt":"How do we estimate the probability of an abundant objects' formation, with minimal context or assumption about is origin? To explore this we have previously introduced the concept of pathway assembly (as pathway complexity), in a graph based context, as an approach to quantify the number of steps required to assembly an object based on a hypothetical history of an objects formation. By partitioning an object into its irreducible parts and counting the steps by which the object can be reassembled from those parts, and considering the probabilities of such steps, the probability that an abundanc"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.06972","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:18:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZKqQswTnITK2RL3xymQWrbLdzpQ6W36h+LfUlYygPjVkG6eGT9SGoiPcd2XtSBeqaw/TpWaQlPSDoKMp7TQ1DA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-02T23:14:51.517886Z"},"content_sha256":"14bcb03ebdbe64d78834054550caf01aaac4b9fa37553e6c577931e2d80e0db6","schema_version":"1.0","event_id":"sha256:14bcb03ebdbe64d78834054550caf01aaac4b9fa37553e6c577931e2d80e0db6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FZAGOVPSBI2N7YE7LG2665WDBR/bundle.json","state_url":"https://pith.science/pith/FZAGOVPSBI2N7YE7LG2665WDBR/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FZAGOVPSBI2N7YE7LG2665WDBR/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-07-02T23:14:51Z","links":{"resolver":"https://pith.science/pith/FZAGOVPSBI2N7YE7LG2665WDBR","bundle":"https://pith.science/pith/FZAGOVPSBI2N7YE7LG2665WDBR/bundle.json","state":"https://pith.science/pith/FZAGOVPSBI2N7YE7LG2665WDBR/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FZAGOVPSBI2N7YE7LG2665WDBR/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:FZAGOVPSBI2N7YE7LG2665WDBR","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":"13f1a111c2b9beeb7155cefa20968e4f5124250796e8909d79a543119841e05c","cross_cats_sorted":["cs.CC","math.IT"],"license":"http://creativecommons.org/publicdomain/zero/1.0/","primary_cat":"cs.IT","submitted_at":"2018-04-19T01:56:59Z","title_canon_sha256":"259164fc6dc9c2e678905678b5ec0713f4cba8ac1e22b6472f0d3ea80bab2e25"},"schema_version":"1.0","source":{"id":"1804.06972","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1804.06972","created_at":"2026-05-18T00:18:04Z"},{"alias_kind":"arxiv_version","alias_value":"1804.06972v1","created_at":"2026-05-18T00:18:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.06972","created_at":"2026-05-18T00:18:04Z"},{"alias_kind":"pith_short_12","alias_value":"FZAGOVPSBI2N","created_at":"2026-05-18T12:32:25Z"},{"alias_kind":"pith_short_16","alias_value":"FZAGOVPSBI2N7YE7","created_at":"2026-05-18T12:32:25Z"},{"alias_kind":"pith_short_8","alias_value":"FZAGOVPS","created_at":"2026-05-18T12:32:25Z"}],"graph_snapshots":[{"event_id":"sha256:14bcb03ebdbe64d78834054550caf01aaac4b9fa37553e6c577931e2d80e0db6","target":"graph","created_at":"2026-05-18T00:18:04Z","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":"How do we estimate the probability of an abundant objects' formation, with minimal context or assumption about is origin? To explore this we have previously introduced the concept of pathway assembly (as pathway complexity), in a graph based context, as an approach to quantify the number of steps required to assembly an object based on a hypothetical history of an objects formation. By partitioning an object into its irreducible parts and counting the steps by which the object can be reassembled from those parts, and considering the probabilities of such steps, the probability that an abundanc","authors_text":"Alastair Murray, Leroy Cronin, Stuart Marshall","cross_cats":["cs.CC","math.IT"],"headline":"","license":"http://creativecommons.org/publicdomain/zero/1.0/","primary_cat":"cs.IT","submitted_at":"2018-04-19T01:56:59Z","title":"Defining Pathway Assembly and Exploring its Applications"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.06972","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:2f25720a646667930b8f7283cda21c8582ef7d2770ac732a643f131afec1f08d","target":"record","created_at":"2026-05-18T00:18:04Z","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":"13f1a111c2b9beeb7155cefa20968e4f5124250796e8909d79a543119841e05c","cross_cats_sorted":["cs.CC","math.IT"],"license":"http://creativecommons.org/publicdomain/zero/1.0/","primary_cat":"cs.IT","submitted_at":"2018-04-19T01:56:59Z","title_canon_sha256":"259164fc6dc9c2e678905678b5ec0713f4cba8ac1e22b6472f0d3ea80bab2e25"},"schema_version":"1.0","source":{"id":"1804.06972","kind":"arxiv","version":1}},"canonical_sha256":"2e406755f20a34dfe09f59b5ef76c30c66c7a45dad2bc4d05deb97360df8e0cc","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2e406755f20a34dfe09f59b5ef76c30c66c7a45dad2bc4d05deb97360df8e0cc","first_computed_at":"2026-05-18T00:18:04.672092Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:18:04.672092Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"xfxA4aKRTjHC9jbqkNMrNcfd5OKSSkwAel+e0X2sINSMz6YPdBokyWjHtpc1s+PCNMguw6+gQTGZdsgp/yChBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:18:04.672774Z","signed_message":"canonical_sha256_bytes"},"source_id":"1804.06972","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2f25720a646667930b8f7283cda21c8582ef7d2770ac732a643f131afec1f08d","sha256:14bcb03ebdbe64d78834054550caf01aaac4b9fa37553e6c577931e2d80e0db6"],"state_sha256":"c6a63926e134683f096867c566c0bf06ec1661eab8a972680cdff8d7c38e4699"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kYm4iAyZ03MXFyPbOmF7QVjq8UVKFecX6BCyMdEzrvvjOReL0sFKEoP9hNS6gkuforffDyKJW4QatnU4MSTpBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-02T23:14:51.519773Z","bundle_sha256":"de69513846e0efa791c4f6a0cdc99a5aed8f8d4825e4c448c7488b1670a3cfa9"}}