{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:DKNS6N53BQ4I4WCJQ2SGETP35M","short_pith_number":"pith:DKNS6N53","canonical_record":{"source":{"id":"1312.7306","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2013-12-27T18:09:40Z","cross_cats_sorted":["cs.DS","q-bio.MN"],"title_canon_sha256":"19cd1194f6d1accf574a45896257fefd4d3ac096d6bd9ec6cc392109253f034c","abstract_canon_sha256":"aa31bf5204655504c65fe4c7969de52fd29786df258b2aa575c7e3769d8db6d9"},"schema_version":"1.0"},"canonical_sha256":"1a9b2f37bb0c388e584986a4624dfbeb0ba0b1b6553a8456f008a76f3f802e63","source":{"kind":"arxiv","id":"1312.7306","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1312.7306","created_at":"2026-05-18T03:03:45Z"},{"alias_kind":"arxiv_version","alias_value":"1312.7306v1","created_at":"2026-05-18T03:03:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1312.7306","created_at":"2026-05-18T03:03:45Z"},{"alias_kind":"pith_short_12","alias_value":"DKNS6N53BQ4I","created_at":"2026-05-18T12:27:43Z"},{"alias_kind":"pith_short_16","alias_value":"DKNS6N53BQ4I4WCJ","created_at":"2026-05-18T12:27:43Z"},{"alias_kind":"pith_short_8","alias_value":"DKNS6N53","created_at":"2026-05-18T12:27:43Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:DKNS6N53BQ4I4WCJQ2SGETP35M","target":"record","payload":{"canonical_record":{"source":{"id":"1312.7306","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2013-12-27T18:09:40Z","cross_cats_sorted":["cs.DS","q-bio.MN"],"title_canon_sha256":"19cd1194f6d1accf574a45896257fefd4d3ac096d6bd9ec6cc392109253f034c","abstract_canon_sha256":"aa31bf5204655504c65fe4c7969de52fd29786df258b2aa575c7e3769d8db6d9"},"schema_version":"1.0"},"canonical_sha256":"1a9b2f37bb0c388e584986a4624dfbeb0ba0b1b6553a8456f008a76f3f802e63","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:03:45.188902Z","signature_b64":"+hSvkxoPDRuHlmcSae0G4/d7gqvNHhtQQbt5aleryuQajzyIx9WJHVzsOPWZym8lXf2uerAHTtBlccwwCu5HAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1a9b2f37bb0c388e584986a4624dfbeb0ba0b1b6553a8456f008a76f3f802e63","last_reissued_at":"2026-05-18T03:03:45.188207Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:03:45.188207Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1312.7306","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-18T03:03:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rD4gkzRrAx+USoVk3ZzHZ05B/VrKOo4IT7Jmwil6ChWe2rVKTDXrO+6ty9dRs24DAZ4ALiEWHcRSGPEWOx0gDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T22:14:14.430301Z"},"content_sha256":"b3e757a7bad98e2cd4bd1604d67f04234d1231d54ef2613525dc0d6d8b684039","schema_version":"1.0","event_id":"sha256:b3e757a7bad98e2cd4bd1604d67f04234d1231d54ef2613525dc0d6d8b684039"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:DKNS6N53BQ4I4WCJQ2SGETP35M","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Algorithmic Perspectives of Network Transitive Reduction Problems and their Applications to Synthesis and Analysis of Biological Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","q-bio.MN"],"primary_cat":"cs.CC","authors_text":"Bhaskar DasGupta, Marek Karpinski, Satabdi Aditya","submitted_at":"2013-12-27T18:09:40Z","abstract_excerpt":"In this survey paper, we will present a number of core algorithmic questions concerning several transitive reduction problems on network that have applications in network synthesis and analysis involving cellular processes. Our starting point will be the so-called minimum equivalent digraph problem, a classic computational problem in combinatorial algorithms. We will subsequently consider a few non-trivial extensions or generalizations of this problem motivated by applications in systems biology. We will then discuss the applications of these algorithmic methodologies in the context of three m"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1312.7306","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-18T03:03:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"G6hlBJHmEwP4ebQAwWXYXiiz4b4jAqW7zANdhkLxv0o41IUZG6T/LylrRO0lXqdIErl4uSLTyxiEJpkwUHrxDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T22:14:14.430963Z"},"content_sha256":"49b7c2c31aafa12d58506ff2535151c8d7387a21f2ece1fe98710d01cc0e93dd","schema_version":"1.0","event_id":"sha256:49b7c2c31aafa12d58506ff2535151c8d7387a21f2ece1fe98710d01cc0e93dd"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DKNS6N53BQ4I4WCJQ2SGETP35M/bundle.json","state_url":"https://pith.science/pith/DKNS6N53BQ4I4WCJQ2SGETP35M/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DKNS6N53BQ4I4WCJQ2SGETP35M/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-05-28T22:14:14Z","links":{"resolver":"https://pith.science/pith/DKNS6N53BQ4I4WCJQ2SGETP35M","bundle":"https://pith.science/pith/DKNS6N53BQ4I4WCJQ2SGETP35M/bundle.json","state":"https://pith.science/pith/DKNS6N53BQ4I4WCJQ2SGETP35M/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DKNS6N53BQ4I4WCJQ2SGETP35M/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:DKNS6N53BQ4I4WCJQ2SGETP35M","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":"aa31bf5204655504c65fe4c7969de52fd29786df258b2aa575c7e3769d8db6d9","cross_cats_sorted":["cs.DS","q-bio.MN"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2013-12-27T18:09:40Z","title_canon_sha256":"19cd1194f6d1accf574a45896257fefd4d3ac096d6bd9ec6cc392109253f034c"},"schema_version":"1.0","source":{"id":"1312.7306","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1312.7306","created_at":"2026-05-18T03:03:45Z"},{"alias_kind":"arxiv_version","alias_value":"1312.7306v1","created_at":"2026-05-18T03:03:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1312.7306","created_at":"2026-05-18T03:03:45Z"},{"alias_kind":"pith_short_12","alias_value":"DKNS6N53BQ4I","created_at":"2026-05-18T12:27:43Z"},{"alias_kind":"pith_short_16","alias_value":"DKNS6N53BQ4I4WCJ","created_at":"2026-05-18T12:27:43Z"},{"alias_kind":"pith_short_8","alias_value":"DKNS6N53","created_at":"2026-05-18T12:27:43Z"}],"graph_snapshots":[{"event_id":"sha256:49b7c2c31aafa12d58506ff2535151c8d7387a21f2ece1fe98710d01cc0e93dd","target":"graph","created_at":"2026-05-18T03:03:45Z","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":"In this survey paper, we will present a number of core algorithmic questions concerning several transitive reduction problems on network that have applications in network synthesis and analysis involving cellular processes. Our starting point will be the so-called minimum equivalent digraph problem, a classic computational problem in combinatorial algorithms. We will subsequently consider a few non-trivial extensions or generalizations of this problem motivated by applications in systems biology. We will then discuss the applications of these algorithmic methodologies in the context of three m","authors_text":"Bhaskar DasGupta, Marek Karpinski, Satabdi Aditya","cross_cats":["cs.DS","q-bio.MN"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2013-12-27T18:09:40Z","title":"Algorithmic Perspectives of Network Transitive Reduction Problems and their Applications to Synthesis and Analysis of Biological Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1312.7306","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:b3e757a7bad98e2cd4bd1604d67f04234d1231d54ef2613525dc0d6d8b684039","target":"record","created_at":"2026-05-18T03:03:45Z","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":"aa31bf5204655504c65fe4c7969de52fd29786df258b2aa575c7e3769d8db6d9","cross_cats_sorted":["cs.DS","q-bio.MN"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2013-12-27T18:09:40Z","title_canon_sha256":"19cd1194f6d1accf574a45896257fefd4d3ac096d6bd9ec6cc392109253f034c"},"schema_version":"1.0","source":{"id":"1312.7306","kind":"arxiv","version":1}},"canonical_sha256":"1a9b2f37bb0c388e584986a4624dfbeb0ba0b1b6553a8456f008a76f3f802e63","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1a9b2f37bb0c388e584986a4624dfbeb0ba0b1b6553a8456f008a76f3f802e63","first_computed_at":"2026-05-18T03:03:45.188207Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:03:45.188207Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"+hSvkxoPDRuHlmcSae0G4/d7gqvNHhtQQbt5aleryuQajzyIx9WJHVzsOPWZym8lXf2uerAHTtBlccwwCu5HAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:03:45.188902Z","signed_message":"canonical_sha256_bytes"},"source_id":"1312.7306","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b3e757a7bad98e2cd4bd1604d67f04234d1231d54ef2613525dc0d6d8b684039","sha256:49b7c2c31aafa12d58506ff2535151c8d7387a21f2ece1fe98710d01cc0e93dd"],"state_sha256":"f5fdec86dfe2f3554ec3d73cf4cd050134d8d0e213333dd22d6887281cf35f01"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JN7B+QBJxbkSxKmj1nFN8B9oA2yp7Igv71/aKaYlTEamf8qWBq/VZ7fan4Gs3gqiv+Int/GZU+ubpMTQic+YCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T22:14:14.434385Z","bundle_sha256":"c7b964e6f0ebd0f4dba88b4b509ab1323fecd538264cbdbbe75f2268f8851e6d"}}