{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:LUIEXAZIWN4NC7X3XGBAFEBUS3","short_pith_number":"pith:LUIEXAZI","canonical_record":{"source":{"id":"1904.06994","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2019-04-15T12:30:00Z","cross_cats_sorted":[],"title_canon_sha256":"e2a44822e90098d0a371496d86926c076aecfd075692a85baca331c7711da893","abstract_canon_sha256":"d1b404d7486b7114b5312f195851a09f0c482e8ea8d6c2445aba9a7526fd3624"},"schema_version":"1.0"},"canonical_sha256":"5d104b8328b378d17efbb98202903496f14490fbd60aa1f9823c5a5f112a79c2","source":{"kind":"arxiv","id":"1904.06994","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1904.06994","created_at":"2026-05-17T23:48:35Z"},{"alias_kind":"arxiv_version","alias_value":"1904.06994v1","created_at":"2026-05-17T23:48:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.06994","created_at":"2026-05-17T23:48:35Z"},{"alias_kind":"pith_short_12","alias_value":"LUIEXAZIWN4N","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_16","alias_value":"LUIEXAZIWN4NC7X3","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_8","alias_value":"LUIEXAZI","created_at":"2026-05-18T12:33:21Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:LUIEXAZIWN4NC7X3XGBAFEBUS3","target":"record","payload":{"canonical_record":{"source":{"id":"1904.06994","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2019-04-15T12:30:00Z","cross_cats_sorted":[],"title_canon_sha256":"e2a44822e90098d0a371496d86926c076aecfd075692a85baca331c7711da893","abstract_canon_sha256":"d1b404d7486b7114b5312f195851a09f0c482e8ea8d6c2445aba9a7526fd3624"},"schema_version":"1.0"},"canonical_sha256":"5d104b8328b378d17efbb98202903496f14490fbd60aa1f9823c5a5f112a79c2","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:48:35.538194Z","signature_b64":"BQAhoVcG6Qd7uAklQqCPdPm9sg2Nd7QitREhshyL2c3pFFWfwmFWQIjFiUAJj+InZI0bAobOv68Vqi3M2DdOAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5d104b8328b378d17efbb98202903496f14490fbd60aa1f9823c5a5f112a79c2","last_reissued_at":"2026-05-17T23:48:35.537546Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:48:35.537546Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1904.06994","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-17T23:48:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RWkG9pccILpH2NsD4gOlP4VwQ2kzmc4GiShgUOd+b3FnsSOrgbr4MQum20NJ+lpeoFMBjdrGKgDclDSYncWBBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T20:31:25.491201Z"},"content_sha256":"1126036d9412e658f0bf7fdf70d810d38f9e2e484627aae2808ba0fee8c63dd5","schema_version":"1.0","event_id":"sha256:1126036d9412e658f0bf7fdf70d810d38f9e2e484627aae2808ba0fee8c63dd5"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:LUIEXAZIWN4NC7X3XGBAFEBUS3","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Adapted and constrained Dijkstra for elastic optical networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NI","authors_text":"Bo\\.zena Wo\\'zna-Szcze\\'sniak, Ireneusz Szcze\\'sniak","submitted_at":"2019-04-15T12:30:00Z","abstract_excerpt":"We present an optimal and efficient algorithm for finding a shortest path in an elastic optical network. The algorithm is an adaptation of the Dijkstra shortest path algorithm, where we take into account the spectrum continuity and contiguity constraints, and a limit on the path length. The adaptation redefines the node label in the Dijkstra algorithm, allows for revisiting nodes even at a higher cost for different slices, avoids loops, and prunes worse labels. The algorithm is generic and agnostic of a specific spectrum allocation policy, as it finds the largest set of available slices from w"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1904.06994","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-17T23:48:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eAIAr3cScp+w9hUaAMxrf5EEh76ldt+faZkI80eekIGhxbqVg97nvfsKPh+e+mTf2ZtRhPMoCB0Nw9k/MCX1AQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T20:31:25.491574Z"},"content_sha256":"edb6b764268c2ad701c4cd461752ceb9b5d3f86080f46cb900c1185620ea9166","schema_version":"1.0","event_id":"sha256:edb6b764268c2ad701c4cd461752ceb9b5d3f86080f46cb900c1185620ea9166"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LUIEXAZIWN4NC7X3XGBAFEBUS3/bundle.json","state_url":"https://pith.science/pith/LUIEXAZIWN4NC7X3XGBAFEBUS3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LUIEXAZIWN4NC7X3XGBAFEBUS3/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-24T20:31:25Z","links":{"resolver":"https://pith.science/pith/LUIEXAZIWN4NC7X3XGBAFEBUS3","bundle":"https://pith.science/pith/LUIEXAZIWN4NC7X3XGBAFEBUS3/bundle.json","state":"https://pith.science/pith/LUIEXAZIWN4NC7X3XGBAFEBUS3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LUIEXAZIWN4NC7X3XGBAFEBUS3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:LUIEXAZIWN4NC7X3XGBAFEBUS3","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":"d1b404d7486b7114b5312f195851a09f0c482e8ea8d6c2445aba9a7526fd3624","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2019-04-15T12:30:00Z","title_canon_sha256":"e2a44822e90098d0a371496d86926c076aecfd075692a85baca331c7711da893"},"schema_version":"1.0","source":{"id":"1904.06994","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1904.06994","created_at":"2026-05-17T23:48:35Z"},{"alias_kind":"arxiv_version","alias_value":"1904.06994v1","created_at":"2026-05-17T23:48:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.06994","created_at":"2026-05-17T23:48:35Z"},{"alias_kind":"pith_short_12","alias_value":"LUIEXAZIWN4N","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_16","alias_value":"LUIEXAZIWN4NC7X3","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_8","alias_value":"LUIEXAZI","created_at":"2026-05-18T12:33:21Z"}],"graph_snapshots":[{"event_id":"sha256:edb6b764268c2ad701c4cd461752ceb9b5d3f86080f46cb900c1185620ea9166","target":"graph","created_at":"2026-05-17T23:48:35Z","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 an optimal and efficient algorithm for finding a shortest path in an elastic optical network. The algorithm is an adaptation of the Dijkstra shortest path algorithm, where we take into account the spectrum continuity and contiguity constraints, and a limit on the path length. The adaptation redefines the node label in the Dijkstra algorithm, allows for revisiting nodes even at a higher cost for different slices, avoids loops, and prunes worse labels. The algorithm is generic and agnostic of a specific spectrum allocation policy, as it finds the largest set of available slices from w","authors_text":"Bo\\.zena Wo\\'zna-Szcze\\'sniak, Ireneusz Szcze\\'sniak","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2019-04-15T12:30:00Z","title":"Adapted and constrained Dijkstra for elastic optical networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1904.06994","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:1126036d9412e658f0bf7fdf70d810d38f9e2e484627aae2808ba0fee8c63dd5","target":"record","created_at":"2026-05-17T23:48:35Z","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":"d1b404d7486b7114b5312f195851a09f0c482e8ea8d6c2445aba9a7526fd3624","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2019-04-15T12:30:00Z","title_canon_sha256":"e2a44822e90098d0a371496d86926c076aecfd075692a85baca331c7711da893"},"schema_version":"1.0","source":{"id":"1904.06994","kind":"arxiv","version":1}},"canonical_sha256":"5d104b8328b378d17efbb98202903496f14490fbd60aa1f9823c5a5f112a79c2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5d104b8328b378d17efbb98202903496f14490fbd60aa1f9823c5a5f112a79c2","first_computed_at":"2026-05-17T23:48:35.537546Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:48:35.537546Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"BQAhoVcG6Qd7uAklQqCPdPm9sg2Nd7QitREhshyL2c3pFFWfwmFWQIjFiUAJj+InZI0bAobOv68Vqi3M2DdOAg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:48:35.538194Z","signed_message":"canonical_sha256_bytes"},"source_id":"1904.06994","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1126036d9412e658f0bf7fdf70d810d38f9e2e484627aae2808ba0fee8c63dd5","sha256:edb6b764268c2ad701c4cd461752ceb9b5d3f86080f46cb900c1185620ea9166"],"state_sha256":"1681f5a341dbcc2a48a4ddc14154596eb87f89d8a42917982425780aea98a334"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XXvWyPFj4oXhNdOl/skTJTNnHh7vSB9fhEuOUyl2pL8BsU5bzcAqz7aSq6tCV7hQns0SvMRiUk+QqLSubzyDDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-24T20:31:25.493539Z","bundle_sha256":"86ccbf2dc4002017c2631d18a4b489e57e2eeba0fb34055cc0432dd60a4ca443"}}