{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:LUIEXAZIWN4NC7X3XGBAFEBUS3","short_pith_number":"pith:LUIEXAZI","schema_version":"1.0","canonical_sha256":"5d104b8328b378d17efbb98202903496f14490fbd60aa1f9823c5a5f112a79c2","source":{"kind":"arxiv","id":"1904.06994","version":1},"attestation_state":"computed","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1904.06994","created_at":"2026-05-17T23:48:35.537642+00:00"},{"alias_kind":"arxiv_version","alias_value":"1904.06994v1","created_at":"2026-05-17T23:48:35.537642+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.06994","created_at":"2026-05-17T23:48:35.537642+00:00"},{"alias_kind":"pith_short_12","alias_value":"LUIEXAZIWN4N","created_at":"2026-05-18T12:33:21.387695+00:00"},{"alias_kind":"pith_short_16","alias_value":"LUIEXAZIWN4NC7X3","created_at":"2026-05-18T12:33:21.387695+00:00"},{"alias_kind":"pith_short_8","alias_value":"LUIEXAZI","created_at":"2026-05-18T12:33:21.387695+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/LUIEXAZIWN4NC7X3XGBAFEBUS3","json":"https://pith.science/pith/LUIEXAZIWN4NC7X3XGBAFEBUS3.json","graph_json":"https://pith.science/api/pith-number/LUIEXAZIWN4NC7X3XGBAFEBUS3/graph.json","events_json":"https://pith.science/api/pith-number/LUIEXAZIWN4NC7X3XGBAFEBUS3/events.json","paper":"https://pith.science/paper/LUIEXAZI"},"agent_actions":{"view_html":"https://pith.science/pith/LUIEXAZIWN4NC7X3XGBAFEBUS3","download_json":"https://pith.science/pith/LUIEXAZIWN4NC7X3XGBAFEBUS3.json","view_paper":"https://pith.science/paper/LUIEXAZI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1904.06994&json=true","fetch_graph":"https://pith.science/api/pith-number/LUIEXAZIWN4NC7X3XGBAFEBUS3/graph.json","fetch_events":"https://pith.science/api/pith-number/LUIEXAZIWN4NC7X3XGBAFEBUS3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LUIEXAZIWN4NC7X3XGBAFEBUS3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LUIEXAZIWN4NC7X3XGBAFEBUS3/action/storage_attestation","attest_author":"https://pith.science/pith/LUIEXAZIWN4NC7X3XGBAFEBUS3/action/author_attestation","sign_citation":"https://pith.science/pith/LUIEXAZIWN4NC7X3XGBAFEBUS3/action/citation_signature","submit_replication":"https://pith.science/pith/LUIEXAZIWN4NC7X3XGBAFEBUS3/action/replication_record"}},"created_at":"2026-05-17T23:48:35.537642+00:00","updated_at":"2026-05-17T23:48:35.537642+00:00"}