{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:4MNDEP7KH3NL77KACBQAYWPN7F","short_pith_number":"pith:4MNDEP7K","canonical_record":{"source":{"id":"1301.4287","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2013-01-18T02:43:41Z","cross_cats_sorted":[],"title_canon_sha256":"11381a6fbc7ae4d94d48f1746f01a1b0465300241ee514e5ed01745475c5b71b","abstract_canon_sha256":"cfa20a9aafe43ca6ea49571a633305077729debf7244c156f204be93f982ed63"},"schema_version":"1.0"},"canonical_sha256":"e31a323fea3edabffd4010600c59edf946ff1270c6f061cb70f356bf19285cef","source":{"kind":"arxiv","id":"1301.4287","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1301.4287","created_at":"2026-05-18T03:36:05Z"},{"alias_kind":"arxiv_version","alias_value":"1301.4287v1","created_at":"2026-05-18T03:36:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1301.4287","created_at":"2026-05-18T03:36:05Z"},{"alias_kind":"pith_short_12","alias_value":"4MNDEP7KH3NL","created_at":"2026-05-18T12:27:34Z"},{"alias_kind":"pith_short_16","alias_value":"4MNDEP7KH3NL77KA","created_at":"2026-05-18T12:27:34Z"},{"alias_kind":"pith_short_8","alias_value":"4MNDEP7K","created_at":"2026-05-18T12:27:34Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:4MNDEP7KH3NL77KACBQAYWPN7F","target":"record","payload":{"canonical_record":{"source":{"id":"1301.4287","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2013-01-18T02:43:41Z","cross_cats_sorted":[],"title_canon_sha256":"11381a6fbc7ae4d94d48f1746f01a1b0465300241ee514e5ed01745475c5b71b","abstract_canon_sha256":"cfa20a9aafe43ca6ea49571a633305077729debf7244c156f204be93f982ed63"},"schema_version":"1.0"},"canonical_sha256":"e31a323fea3edabffd4010600c59edf946ff1270c6f061cb70f356bf19285cef","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:36:05.715670Z","signature_b64":"x8p7UHd3EMlosNtYVkvim7dZvBzkxPP2HTiVmIkGlqMf1TF157DcJ7WMq8w3Az9IvC52DKhrpoZhjs85VQJWDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e31a323fea3edabffd4010600c59edf946ff1270c6f061cb70f356bf19285cef","last_reissued_at":"2026-05-18T03:36:05.715216Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:36:05.715216Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1301.4287","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:36:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vWlKGSYhKlScX3uThBUfNHwI1lr/dRBmdLo+9u5Hfl20gFZqCXh2hrYAep2xEHOtFHdU0yM0oTRwzDFS/dIqBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T03:23:48.512272Z"},"content_sha256":"bb96151ee4c66b6aa604e5951817ef73a143151e34fd26206154e43ebbcadd0c","schema_version":"1.0","event_id":"sha256:bb96151ee4c66b6aa604e5951817ef73a143151e34fd26206154e43ebbcadd0c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:4MNDEP7KH3NL77KACBQAYWPN7F","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Maximizing Reliability in WDM Networks through Lightpath Routing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NI","authors_text":"Eytan Modiano, Hyang-Won Lee, Kayi Lee","submitted_at":"2013-01-18T02:43:41Z","abstract_excerpt":"We study the reliability maximization problem in WDM networks with random link failures. Reliability in these networks is defined as the probability that the logical network is connected, and it is determined by the underlying lightpath routing, network topologies and the link failure probability. By introducing the notion of lexicographical ordering for lightpath routings, we characterize precise optimization criteria for maximum reliability in the low failure probability regime. Based on the optimization criteria, we develop lightpath routing algorithms that maximize the reliability, and log"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1301.4287","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:36:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"J/gcL87EdzJEJR0AVeCD8LkNOutgZdCad+c2saA0jnMrekNQPHFVUvLmgWdw4KpT4hJ16eQrMktUVLOUA52QDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T03:23:48.512648Z"},"content_sha256":"da32c1ca795b73ff162ed61b92b5ac7523774ef1058376d166e9b77d75afb412","schema_version":"1.0","event_id":"sha256:da32c1ca795b73ff162ed61b92b5ac7523774ef1058376d166e9b77d75afb412"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4MNDEP7KH3NL77KACBQAYWPN7F/bundle.json","state_url":"https://pith.science/pith/4MNDEP7KH3NL77KACBQAYWPN7F/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4MNDEP7KH3NL77KACBQAYWPN7F/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-28T03:23:48Z","links":{"resolver":"https://pith.science/pith/4MNDEP7KH3NL77KACBQAYWPN7F","bundle":"https://pith.science/pith/4MNDEP7KH3NL77KACBQAYWPN7F/bundle.json","state":"https://pith.science/pith/4MNDEP7KH3NL77KACBQAYWPN7F/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4MNDEP7KH3NL77KACBQAYWPN7F/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:4MNDEP7KH3NL77KACBQAYWPN7F","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":"cfa20a9aafe43ca6ea49571a633305077729debf7244c156f204be93f982ed63","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2013-01-18T02:43:41Z","title_canon_sha256":"11381a6fbc7ae4d94d48f1746f01a1b0465300241ee514e5ed01745475c5b71b"},"schema_version":"1.0","source":{"id":"1301.4287","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1301.4287","created_at":"2026-05-18T03:36:05Z"},{"alias_kind":"arxiv_version","alias_value":"1301.4287v1","created_at":"2026-05-18T03:36:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1301.4287","created_at":"2026-05-18T03:36:05Z"},{"alias_kind":"pith_short_12","alias_value":"4MNDEP7KH3NL","created_at":"2026-05-18T12:27:34Z"},{"alias_kind":"pith_short_16","alias_value":"4MNDEP7KH3NL77KA","created_at":"2026-05-18T12:27:34Z"},{"alias_kind":"pith_short_8","alias_value":"4MNDEP7K","created_at":"2026-05-18T12:27:34Z"}],"graph_snapshots":[{"event_id":"sha256:da32c1ca795b73ff162ed61b92b5ac7523774ef1058376d166e9b77d75afb412","target":"graph","created_at":"2026-05-18T03:36:05Z","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 study the reliability maximization problem in WDM networks with random link failures. Reliability in these networks is defined as the probability that the logical network is connected, and it is determined by the underlying lightpath routing, network topologies and the link failure probability. By introducing the notion of lexicographical ordering for lightpath routings, we characterize precise optimization criteria for maximum reliability in the low failure probability regime. Based on the optimization criteria, we develop lightpath routing algorithms that maximize the reliability, and log","authors_text":"Eytan Modiano, Hyang-Won Lee, Kayi Lee","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2013-01-18T02:43:41Z","title":"Maximizing Reliability in WDM Networks through Lightpath Routing"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1301.4287","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:bb96151ee4c66b6aa604e5951817ef73a143151e34fd26206154e43ebbcadd0c","target":"record","created_at":"2026-05-18T03:36:05Z","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":"cfa20a9aafe43ca6ea49571a633305077729debf7244c156f204be93f982ed63","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2013-01-18T02:43:41Z","title_canon_sha256":"11381a6fbc7ae4d94d48f1746f01a1b0465300241ee514e5ed01745475c5b71b"},"schema_version":"1.0","source":{"id":"1301.4287","kind":"arxiv","version":1}},"canonical_sha256":"e31a323fea3edabffd4010600c59edf946ff1270c6f061cb70f356bf19285cef","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e31a323fea3edabffd4010600c59edf946ff1270c6f061cb70f356bf19285cef","first_computed_at":"2026-05-18T03:36:05.715216Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:36:05.715216Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"x8p7UHd3EMlosNtYVkvim7dZvBzkxPP2HTiVmIkGlqMf1TF157DcJ7WMq8w3Az9IvC52DKhrpoZhjs85VQJWDA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:36:05.715670Z","signed_message":"canonical_sha256_bytes"},"source_id":"1301.4287","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:bb96151ee4c66b6aa604e5951817ef73a143151e34fd26206154e43ebbcadd0c","sha256:da32c1ca795b73ff162ed61b92b5ac7523774ef1058376d166e9b77d75afb412"],"state_sha256":"7370e539592560127685661b3a3fc797d32bbd3593996a675d6525373b8632a6"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CtB0ReV3HXt7fooqvjCi6fyZV4KdnpRQ5YG6y2M5gXvhb1IUOl4UrnP/gcALaa289je4pjJdDlH1KvddyFETAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T03:23:48.514638Z","bundle_sha256":"04fda89dfa6bb2e8b883ece79783b8138526ee5afa078e9d93490736fdad1fc2"}}