{"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"}