{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:R62SEODEBYB6BR3AELEGXYWW4T","short_pith_number":"pith:R62SEODE","canonical_record":{"source":{"id":"1012.5024","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2010-12-22T16:16:11Z","cross_cats_sorted":[],"title_canon_sha256":"be15d25f6be1498fde338ef552324e621a59c24e4b0cc6a4d3cd439b65c87231","abstract_canon_sha256":"2360dda7b9a649cb52046ea822ecb44be12e73b775873cf3f8a6c190eb4910b5"},"schema_version":"1.0"},"canonical_sha256":"8fb52238640e03e0c76022c86be2d6e4f8ad3b7af5d2870db2795b1e2c6592bb","source":{"kind":"arxiv","id":"1012.5024","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1012.5024","created_at":"2026-05-18T04:32:44Z"},{"alias_kind":"arxiv_version","alias_value":"1012.5024v1","created_at":"2026-05-18T04:32:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1012.5024","created_at":"2026-05-18T04:32:44Z"},{"alias_kind":"pith_short_12","alias_value":"R62SEODEBYB6","created_at":"2026-05-18T12:26:13Z"},{"alias_kind":"pith_short_16","alias_value":"R62SEODEBYB6BR3A","created_at":"2026-05-18T12:26:13Z"},{"alias_kind":"pith_short_8","alias_value":"R62SEODE","created_at":"2026-05-18T12:26:13Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:R62SEODEBYB6BR3AELEGXYWW4T","target":"record","payload":{"canonical_record":{"source":{"id":"1012.5024","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2010-12-22T16:16:11Z","cross_cats_sorted":[],"title_canon_sha256":"be15d25f6be1498fde338ef552324e621a59c24e4b0cc6a4d3cd439b65c87231","abstract_canon_sha256":"2360dda7b9a649cb52046ea822ecb44be12e73b775873cf3f8a6c190eb4910b5"},"schema_version":"1.0"},"canonical_sha256":"8fb52238640e03e0c76022c86be2d6e4f8ad3b7af5d2870db2795b1e2c6592bb","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:32:44.656506Z","signature_b64":"Nrie1ANp+ebmlqpfcjGJ3I9KGIMUttG8ixz/uTml1T4f+TbHujtl8dQPzop0TQrhxpHxTppYbL9glbmUgutvDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8fb52238640e03e0c76022c86be2d6e4f8ad3b7af5d2870db2795b1e2c6592bb","last_reissued_at":"2026-05-18T04:32:44.655973Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:32:44.655973Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1012.5024","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-18T04:32:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"W3ReZ8cnBs3S5CeM9wyjvxZkPBk4UIQEUAxbKOXYw9qQ6RrpOgXrBFZyUnuWt30rwZfvBmb5AdIVs0ula2l5Ag==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T06:04:42.442705Z"},"content_sha256":"35710bdbf52a6c10fb869ae1e16689e864cfc309a3577ca033e9028917b269c9","schema_version":"1.0","event_id":"sha256:35710bdbf52a6c10fb869ae1e16689e864cfc309a3577ca033e9028917b269c9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:R62SEODEBYB6BR3AELEGXYWW4T","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Shortest Paths with Pairwise-Distinct Edge Labels: Finding Biochemical Pathways in Metabolic Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Michael Stelzer, Sandor Fekete, Tom Kamphans","submitted_at":"2010-12-22T16:16:11Z","abstract_excerpt":"A problem studied in Systems Biology is how to find shortest paths in metabolic networks. Unfortunately, simple (i.e., graph theoretic) shortest paths do not properly reflect biochemical facts. An approach to overcome this issue is to use edge labels and search for paths with distinct labels.\n  In this paper, we show that such biologically feasible shortest paths are hard to compute. Moreover, we present solutions to find such paths in networks in reasonable time."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1012.5024","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-18T04:32:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"h+gy4rcQTJ1z51N1CVdgGq9Ka+dW0Rk5QwjBO0TMWheXlw6pkOr/FGTkOI4D1NLb3P0+VTR3/NmfdVLx2dCDCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T06:04:42.443053Z"},"content_sha256":"bccfb39313c075c053fcedb02f056777b0953f1991673ec9cce2411dc54f72b7","schema_version":"1.0","event_id":"sha256:bccfb39313c075c053fcedb02f056777b0953f1991673ec9cce2411dc54f72b7"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/R62SEODEBYB6BR3AELEGXYWW4T/bundle.json","state_url":"https://pith.science/pith/R62SEODEBYB6BR3AELEGXYWW4T/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/R62SEODEBYB6BR3AELEGXYWW4T/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-04T06:04:42Z","links":{"resolver":"https://pith.science/pith/R62SEODEBYB6BR3AELEGXYWW4T","bundle":"https://pith.science/pith/R62SEODEBYB6BR3AELEGXYWW4T/bundle.json","state":"https://pith.science/pith/R62SEODEBYB6BR3AELEGXYWW4T/state.json","well_known_bundle":"https://pith.science/.well-known/pith/R62SEODEBYB6BR3AELEGXYWW4T/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:R62SEODEBYB6BR3AELEGXYWW4T","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":"2360dda7b9a649cb52046ea822ecb44be12e73b775873cf3f8a6c190eb4910b5","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2010-12-22T16:16:11Z","title_canon_sha256":"be15d25f6be1498fde338ef552324e621a59c24e4b0cc6a4d3cd439b65c87231"},"schema_version":"1.0","source":{"id":"1012.5024","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1012.5024","created_at":"2026-05-18T04:32:44Z"},{"alias_kind":"arxiv_version","alias_value":"1012.5024v1","created_at":"2026-05-18T04:32:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1012.5024","created_at":"2026-05-18T04:32:44Z"},{"alias_kind":"pith_short_12","alias_value":"R62SEODEBYB6","created_at":"2026-05-18T12:26:13Z"},{"alias_kind":"pith_short_16","alias_value":"R62SEODEBYB6BR3A","created_at":"2026-05-18T12:26:13Z"},{"alias_kind":"pith_short_8","alias_value":"R62SEODE","created_at":"2026-05-18T12:26:13Z"}],"graph_snapshots":[{"event_id":"sha256:bccfb39313c075c053fcedb02f056777b0953f1991673ec9cce2411dc54f72b7","target":"graph","created_at":"2026-05-18T04:32:44Z","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 problem studied in Systems Biology is how to find shortest paths in metabolic networks. Unfortunately, simple (i.e., graph theoretic) shortest paths do not properly reflect biochemical facts. An approach to overcome this issue is to use edge labels and search for paths with distinct labels.\n  In this paper, we show that such biologically feasible shortest paths are hard to compute. Moreover, we present solutions to find such paths in networks in reasonable time.","authors_text":"Michael Stelzer, Sandor Fekete, Tom Kamphans","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2010-12-22T16:16:11Z","title":"Shortest Paths with Pairwise-Distinct Edge Labels: Finding Biochemical Pathways in Metabolic Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1012.5024","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:35710bdbf52a6c10fb869ae1e16689e864cfc309a3577ca033e9028917b269c9","target":"record","created_at":"2026-05-18T04:32:44Z","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":"2360dda7b9a649cb52046ea822ecb44be12e73b775873cf3f8a6c190eb4910b5","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2010-12-22T16:16:11Z","title_canon_sha256":"be15d25f6be1498fde338ef552324e621a59c24e4b0cc6a4d3cd439b65c87231"},"schema_version":"1.0","source":{"id":"1012.5024","kind":"arxiv","version":1}},"canonical_sha256":"8fb52238640e03e0c76022c86be2d6e4f8ad3b7af5d2870db2795b1e2c6592bb","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8fb52238640e03e0c76022c86be2d6e4f8ad3b7af5d2870db2795b1e2c6592bb","first_computed_at":"2026-05-18T04:32:44.655973Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:32:44.655973Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Nrie1ANp+ebmlqpfcjGJ3I9KGIMUttG8ixz/uTml1T4f+TbHujtl8dQPzop0TQrhxpHxTppYbL9glbmUgutvDA==","signature_status":"signed_v1","signed_at":"2026-05-18T04:32:44.656506Z","signed_message":"canonical_sha256_bytes"},"source_id":"1012.5024","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:35710bdbf52a6c10fb869ae1e16689e864cfc309a3577ca033e9028917b269c9","sha256:bccfb39313c075c053fcedb02f056777b0953f1991673ec9cce2411dc54f72b7"],"state_sha256":"88ccc2f83e202746ea8561f9cf9b55cd2cf052b76b41cb1cde5a72deb3644617"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Y2xNTkB3trepUOynux4SjSql6hKLPJq9cFCs6xYYbc4fgwFlcZA9v8BJrlcteWtOwtsmN+ekOGEJ6Fy/u+QCDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T06:04:42.445832Z","bundle_sha256":"bc2d33321672c2114f04a2569b95b0c8ed8d8b4973484e6156c54a0328150214"}}