{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:2QM45TDQ7ELHJTSXS44WEXORZG","short_pith_number":"pith:2QM45TDQ","canonical_record":{"source":{"id":"1705.06891","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-05-19T08:34:25Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"8e481e5d8a7bcbcf43b47f9c44e4121e7686e38659eaa48a763d8c00e1c5ee79","abstract_canon_sha256":"2fe1236838650cb71fb0129a67207d94c924df1d38af9a23c698cb438dee37ed"},"schema_version":"1.0"},"canonical_sha256":"d419cecc70f91674ce579739625dd1c9975ec82a930d7cd9e373b9249898e59a","source":{"kind":"arxiv","id":"1705.06891","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1705.06891","created_at":"2026-05-18T00:44:11Z"},{"alias_kind":"arxiv_version","alias_value":"1705.06891v1","created_at":"2026-05-18T00:44:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.06891","created_at":"2026-05-18T00:44:11Z"},{"alias_kind":"pith_short_12","alias_value":"2QM45TDQ7ELH","created_at":"2026-05-18T12:30:55Z"},{"alias_kind":"pith_short_16","alias_value":"2QM45TDQ7ELHJTSX","created_at":"2026-05-18T12:30:55Z"},{"alias_kind":"pith_short_8","alias_value":"2QM45TDQ","created_at":"2026-05-18T12:30:55Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:2QM45TDQ7ELHJTSXS44WEXORZG","target":"record","payload":{"canonical_record":{"source":{"id":"1705.06891","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-05-19T08:34:25Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"8e481e5d8a7bcbcf43b47f9c44e4121e7686e38659eaa48a763d8c00e1c5ee79","abstract_canon_sha256":"2fe1236838650cb71fb0129a67207d94c924df1d38af9a23c698cb438dee37ed"},"schema_version":"1.0"},"canonical_sha256":"d419cecc70f91674ce579739625dd1c9975ec82a930d7cd9e373b9249898e59a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:44:11.037257Z","signature_b64":"22vx7hP93oJN3m33HJ5to3hV2B+/teHCbwWYPJpughHqFNBkjdovdxEk9LYub+rx11PVeKL+AawYyScfKAweAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d419cecc70f91674ce579739625dd1c9975ec82a930d7cd9e373b9249898e59a","last_reissued_at":"2026-05-18T00:44:11.036652Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:44:11.036652Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1705.06891","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-18T00:44:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1mHO+PXKn+L3tYE14XLjfI8txRa6lkeD1fHQ8VZe857inzl+h/Y2G3YGzkMcHauwfo998ZIjGHWbChS24kyTAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-28T13:47:45.679590Z"},"content_sha256":"52f85a69960978e077acd221c5ce6f88b0ad897fffb3fec3384c5fe6d82caefe","schema_version":"1.0","event_id":"sha256:52f85a69960978e077acd221c5ce6f88b0ad897fffb3fec3384c5fe6d82caefe"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:2QM45TDQ7ELHJTSXS44WEXORZG","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Energy-Efficient Resource Allocation for Elastic Optical Networks using Convex 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-19T08:34:25Z","abstract_excerpt":"We propose a two-stage algorithm for energy-efficient resource allocation constrained to QoS and physical requirements in OFDM-based EONs. The first stage deals with routing, grooming and traffic ordering and aims at minimizing amplifier power consumption and number of active transponders. We provide a heuristic procedure which yields an acceptable solution for the complex ILP formulation of the routing and grooming. In the second stage, we optimize transponder configuration including spectrum and transmit power parameters to minimize transponder power consumption. We show how QoS and transpon"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.06891","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-18T00:44:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9bipHWC5MyItdaYdu/c3RUdRvkcLhJ5Auyunt9XnYZYgLrjAdJll8o83gj46GYRVSVJ/F11vfqPcZAlXlGSMCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-28T13:47:45.679925Z"},"content_sha256":"3d57e07d59cfe41f9c97a5194042e12a75f9aa19ee42e7414648d604de68fa19","schema_version":"1.0","event_id":"sha256:3d57e07d59cfe41f9c97a5194042e12a75f9aa19ee42e7414648d604de68fa19"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/2QM45TDQ7ELHJTSXS44WEXORZG/bundle.json","state_url":"https://pith.science/pith/2QM45TDQ7ELHJTSXS44WEXORZG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/2QM45TDQ7ELHJTSXS44WEXORZG/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-28T13:47:45Z","links":{"resolver":"https://pith.science/pith/2QM45TDQ7ELHJTSXS44WEXORZG","bundle":"https://pith.science/pith/2QM45TDQ7ELHJTSXS44WEXORZG/bundle.json","state":"https://pith.science/pith/2QM45TDQ7ELHJTSXS44WEXORZG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/2QM45TDQ7ELHJTSXS44WEXORZG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:2QM45TDQ7ELHJTSXS44WEXORZG","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":"2fe1236838650cb71fb0129a67207d94c924df1d38af9a23c698cb438dee37ed","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-05-19T08:34:25Z","title_canon_sha256":"8e481e5d8a7bcbcf43b47f9c44e4121e7686e38659eaa48a763d8c00e1c5ee79"},"schema_version":"1.0","source":{"id":"1705.06891","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1705.06891","created_at":"2026-05-18T00:44:11Z"},{"alias_kind":"arxiv_version","alias_value":"1705.06891v1","created_at":"2026-05-18T00:44:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.06891","created_at":"2026-05-18T00:44:11Z"},{"alias_kind":"pith_short_12","alias_value":"2QM45TDQ7ELH","created_at":"2026-05-18T12:30:55Z"},{"alias_kind":"pith_short_16","alias_value":"2QM45TDQ7ELHJTSX","created_at":"2026-05-18T12:30:55Z"},{"alias_kind":"pith_short_8","alias_value":"2QM45TDQ","created_at":"2026-05-18T12:30:55Z"}],"graph_snapshots":[{"event_id":"sha256:3d57e07d59cfe41f9c97a5194042e12a75f9aa19ee42e7414648d604de68fa19","target":"graph","created_at":"2026-05-18T00:44:11Z","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 propose a two-stage algorithm for energy-efficient resource allocation constrained to QoS and physical requirements in OFDM-based EONs. The first stage deals with routing, grooming and traffic ordering and aims at minimizing amplifier power consumption and number of active transponders. We provide a heuristic procedure which yields an acceptable solution for the complex ILP formulation of the routing and grooming. In the second stage, we optimize transponder configuration including spectrum and transmit power parameters to minimize transponder power consumption. We show how QoS and transpon","authors_text":"Mohammad Hadi, Mohammad Reza Pakravan","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-05-19T08:34:25Z","title":"Energy-Efficient Resource Allocation for Elastic Optical Networks using Convex Optimization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.06891","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:52f85a69960978e077acd221c5ce6f88b0ad897fffb3fec3384c5fe6d82caefe","target":"record","created_at":"2026-05-18T00:44:11Z","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":"2fe1236838650cb71fb0129a67207d94c924df1d38af9a23c698cb438dee37ed","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-05-19T08:34:25Z","title_canon_sha256":"8e481e5d8a7bcbcf43b47f9c44e4121e7686e38659eaa48a763d8c00e1c5ee79"},"schema_version":"1.0","source":{"id":"1705.06891","kind":"arxiv","version":1}},"canonical_sha256":"d419cecc70f91674ce579739625dd1c9975ec82a930d7cd9e373b9249898e59a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d419cecc70f91674ce579739625dd1c9975ec82a930d7cd9e373b9249898e59a","first_computed_at":"2026-05-18T00:44:11.036652Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:44:11.036652Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"22vx7hP93oJN3m33HJ5to3hV2B+/teHCbwWYPJpughHqFNBkjdovdxEk9LYub+rx11PVeKL+AawYyScfKAweAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:44:11.037257Z","signed_message":"canonical_sha256_bytes"},"source_id":"1705.06891","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:52f85a69960978e077acd221c5ce6f88b0ad897fffb3fec3384c5fe6d82caefe","sha256:3d57e07d59cfe41f9c97a5194042e12a75f9aa19ee42e7414648d604de68fa19"],"state_sha256":"e68e5f8d2c3e58d3705acbe0bc1175e74da6c7073471a4f3d76f61b2aed8e8c3"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IkKB6LaLNGx7KdF+SVL0zploSD81OpNPi92y36KJZVrW2Nqei9g1OlK4kncCcH1FNuRX272cR9bG2lAXXSLsCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-28T13:47:45.681770Z","bundle_sha256":"223560ce55478fb27bc789e8bd8f1a08d6691bea6114448998a416e87c2d7fee"}}