{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:Y27BL22TM2ZA3PTY3U26MRPP3N","short_pith_number":"pith:Y27BL22T","schema_version":"1.0","canonical_sha256":"c6be15eb5366b20dbe78dd35e645efdb489d3f2d0d089d6431e2f6557e9daade","source":{"kind":"arxiv","id":"1705.01191","version":1},"attestation_state":"computed","paper":{"title":"Resource Allocation for Elastic Optical Networks using Geometric Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Mohammad Hadi, Mohammad Reza Pakravan","submitted_at":"2017-05-02T22:30:35Z","abstract_excerpt":"Resource allocation with quality of service constraints is one of the most challenging problems in elastic optical networks which is normally formulated as an MINLP optimization program. In this paper, we focus on novel properties of geometric optimization and provide a heuristic approach for resource allocation which is very faster than its MINLP counterpart. Our heuristic consists of two main parts for routing/traffic ordering and power/spectrum assignment. It aims at minimization of transmitted optical power and spectrum usage constrained to quality of service and physical requirements. We "},"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":"1705.01191","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-05-02T22:30:35Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"1178033a9b3aefc1d9063283be4fad47c024ef801c5302ae48527dd3f2c7265d","abstract_canon_sha256":"652457768c0099d3e6c1e944d763908b5c1e5a3f3f4d185295b32f3b70cdfdb1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:45:05.712848Z","signature_b64":"8Sdv6dwK/jInbLR/GNQb4jZWp1z+Z7Y4H7GGIKrkpXTaZH45W3FKRliIStEH58r2s+Rwcwv/O10Wb1EWVftGAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c6be15eb5366b20dbe78dd35e645efdb489d3f2d0d089d6431e2f6557e9daade","last_reissued_at":"2026-05-18T00:45:05.712452Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:45:05.712452Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Resource Allocation for Elastic Optical Networks using Geometric Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Mohammad Hadi, Mohammad Reza Pakravan","submitted_at":"2017-05-02T22:30:35Z","abstract_excerpt":"Resource allocation with quality of service constraints is one of the most challenging problems in elastic optical networks which is normally formulated as an MINLP optimization program. In this paper, we focus on novel properties of geometric optimization and provide a heuristic approach for resource allocation which is very faster than its MINLP counterpart. Our heuristic consists of two main parts for routing/traffic ordering and power/spectrum assignment. It aims at minimization of transmitted optical power and spectrum usage constrained to quality of service and physical requirements. We "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.01191","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":"1705.01191","created_at":"2026-05-18T00:45:05.712515+00:00"},{"alias_kind":"arxiv_version","alias_value":"1705.01191v1","created_at":"2026-05-18T00:45:05.712515+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.01191","created_at":"2026-05-18T00:45:05.712515+00:00"},{"alias_kind":"pith_short_12","alias_value":"Y27BL22TM2ZA","created_at":"2026-05-18T12:31:56.362134+00:00"},{"alias_kind":"pith_short_16","alias_value":"Y27BL22TM2ZA3PTY","created_at":"2026-05-18T12:31:56.362134+00:00"},{"alias_kind":"pith_short_8","alias_value":"Y27BL22T","created_at":"2026-05-18T12:31:56.362134+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/Y27BL22TM2ZA3PTY3U26MRPP3N","json":"https://pith.science/pith/Y27BL22TM2ZA3PTY3U26MRPP3N.json","graph_json":"https://pith.science/api/pith-number/Y27BL22TM2ZA3PTY3U26MRPP3N/graph.json","events_json":"https://pith.science/api/pith-number/Y27BL22TM2ZA3PTY3U26MRPP3N/events.json","paper":"https://pith.science/paper/Y27BL22T"},"agent_actions":{"view_html":"https://pith.science/pith/Y27BL22TM2ZA3PTY3U26MRPP3N","download_json":"https://pith.science/pith/Y27BL22TM2ZA3PTY3U26MRPP3N.json","view_paper":"https://pith.science/paper/Y27BL22T","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1705.01191&json=true","fetch_graph":"https://pith.science/api/pith-number/Y27BL22TM2ZA3PTY3U26MRPP3N/graph.json","fetch_events":"https://pith.science/api/pith-number/Y27BL22TM2ZA3PTY3U26MRPP3N/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/Y27BL22TM2ZA3PTY3U26MRPP3N/action/timestamp_anchor","attest_storage":"https://pith.science/pith/Y27BL22TM2ZA3PTY3U26MRPP3N/action/storage_attestation","attest_author":"https://pith.science/pith/Y27BL22TM2ZA3PTY3U26MRPP3N/action/author_attestation","sign_citation":"https://pith.science/pith/Y27BL22TM2ZA3PTY3U26MRPP3N/action/citation_signature","submit_replication":"https://pith.science/pith/Y27BL22TM2ZA3PTY3U26MRPP3N/action/replication_record"}},"created_at":"2026-05-18T00:45:05.712515+00:00","updated_at":"2026-05-18T00:45:05.712515+00:00"}