{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:7N6RUDGEGFDVXO3UUJBDYZJHUC","short_pith_number":"pith:7N6RUDGE","canonical_record":{"source":{"id":"1403.4144","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2014-03-17T16:00:16Z","cross_cats_sorted":[],"title_canon_sha256":"3f5fd8deed909e3851d1fcf47072529c8679c0c2c8078d188483135fa3449135","abstract_canon_sha256":"33fa965f25c7bcfb92816ec3c9bb3e57b14e84c5fa99cd92cc86b598624b91a3"},"schema_version":"1.0"},"canonical_sha256":"fb7d1a0cc431475bbb74a2423c6527a08e58aec42861ecb350129fcc27043609","source":{"kind":"arxiv","id":"1403.4144","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1403.4144","created_at":"2026-05-18T00:57:52Z"},{"alias_kind":"arxiv_version","alias_value":"1403.4144v1","created_at":"2026-05-18T00:57:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1403.4144","created_at":"2026-05-18T00:57:52Z"},{"alias_kind":"pith_short_12","alias_value":"7N6RUDGEGFDV","created_at":"2026-05-18T12:28:19Z"},{"alias_kind":"pith_short_16","alias_value":"7N6RUDGEGFDVXO3U","created_at":"2026-05-18T12:28:19Z"},{"alias_kind":"pith_short_8","alias_value":"7N6RUDGE","created_at":"2026-05-18T12:28:19Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:7N6RUDGEGFDVXO3UUJBDYZJHUC","target":"record","payload":{"canonical_record":{"source":{"id":"1403.4144","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2014-03-17T16:00:16Z","cross_cats_sorted":[],"title_canon_sha256":"3f5fd8deed909e3851d1fcf47072529c8679c0c2c8078d188483135fa3449135","abstract_canon_sha256":"33fa965f25c7bcfb92816ec3c9bb3e57b14e84c5fa99cd92cc86b598624b91a3"},"schema_version":"1.0"},"canonical_sha256":"fb7d1a0cc431475bbb74a2423c6527a08e58aec42861ecb350129fcc27043609","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:57:52.063990Z","signature_b64":"ExWVJzAYlNP2Us+x+iVaNDfJGOr6pQNFTeGdfXkTQsgYdFMUTtG6kTPBG3u195rnIO7mUKl+9Zbm2/koNsKLCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fb7d1a0cc431475bbb74a2423c6527a08e58aec42861ecb350129fcc27043609","last_reissued_at":"2026-05-18T00:57:52.063419Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:57:52.063419Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1403.4144","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:57:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1fYXGdqs7K4+jlrtwR5ovgwgbGMVvmBj6vpniS7VYe030cw2AEAT/OT7GoVMhIm+62G+yCX8j6ZGNBD9t6JgAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T07:17:44.874223Z"},"content_sha256":"95055ced2e7962d4ed293a87167758362c420ec7e9069b28961aeba71ae55eb7","schema_version":"1.0","event_id":"sha256:95055ced2e7962d4ed293a87167758362c420ec7e9069b28961aeba71ae55eb7"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:7N6RUDGEGFDVXO3UUJBDYZJHUC","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Polynomial Complexity Minimum-Time Scheduling in a Class of Wireless Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NI","authors_text":"Anthony Ephremides, Di Yuan, Qing He, Vangelis Angelakis","submitted_at":"2014-03-17T16:00:16Z","abstract_excerpt":"We consider a wireless network with a set of transmitter-receiver pairs, or links, that share a common channel, and address the problem of emptying finite traffic volume from the transmitters in minimum time. This, so called, minimum-time scheduling problem has been proved to be NP-hard in general. In this paper, we study a class of minimum-time scheduling problems in which the link rates have a particular structure consistent with the assumed environment and topology. We show that global optimality can be reached in polynomial time and derive optimality conditions. Then we consider a more gen"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1403.4144","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:57:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"f9bRx5iEm8dRqFQga4DKWTtZcFchSQ2s1EsxejYdaDi0Xndzh5rHKRlikYMGxLjP/sNsczz6fgixMFPm2c/+CA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T07:17:44.874607Z"},"content_sha256":"c4ffb83030b5ce04d2938f623a219d8845f1ed87ed7552d500bc0e4a9ec183c0","schema_version":"1.0","event_id":"sha256:c4ffb83030b5ce04d2938f623a219d8845f1ed87ed7552d500bc0e4a9ec183c0"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7N6RUDGEGFDVXO3UUJBDYZJHUC/bundle.json","state_url":"https://pith.science/pith/7N6RUDGEGFDVXO3UUJBDYZJHUC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7N6RUDGEGFDVXO3UUJBDYZJHUC/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-05-28T07:17:44Z","links":{"resolver":"https://pith.science/pith/7N6RUDGEGFDVXO3UUJBDYZJHUC","bundle":"https://pith.science/pith/7N6RUDGEGFDVXO3UUJBDYZJHUC/bundle.json","state":"https://pith.science/pith/7N6RUDGEGFDVXO3UUJBDYZJHUC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7N6RUDGEGFDVXO3UUJBDYZJHUC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:7N6RUDGEGFDVXO3UUJBDYZJHUC","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":"33fa965f25c7bcfb92816ec3c9bb3e57b14e84c5fa99cd92cc86b598624b91a3","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2014-03-17T16:00:16Z","title_canon_sha256":"3f5fd8deed909e3851d1fcf47072529c8679c0c2c8078d188483135fa3449135"},"schema_version":"1.0","source":{"id":"1403.4144","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1403.4144","created_at":"2026-05-18T00:57:52Z"},{"alias_kind":"arxiv_version","alias_value":"1403.4144v1","created_at":"2026-05-18T00:57:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1403.4144","created_at":"2026-05-18T00:57:52Z"},{"alias_kind":"pith_short_12","alias_value":"7N6RUDGEGFDV","created_at":"2026-05-18T12:28:19Z"},{"alias_kind":"pith_short_16","alias_value":"7N6RUDGEGFDVXO3U","created_at":"2026-05-18T12:28:19Z"},{"alias_kind":"pith_short_8","alias_value":"7N6RUDGE","created_at":"2026-05-18T12:28:19Z"}],"graph_snapshots":[{"event_id":"sha256:c4ffb83030b5ce04d2938f623a219d8845f1ed87ed7552d500bc0e4a9ec183c0","target":"graph","created_at":"2026-05-18T00:57:52Z","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 consider a wireless network with a set of transmitter-receiver pairs, or links, that share a common channel, and address the problem of emptying finite traffic volume from the transmitters in minimum time. This, so called, minimum-time scheduling problem has been proved to be NP-hard in general. In this paper, we study a class of minimum-time scheduling problems in which the link rates have a particular structure consistent with the assumed environment and topology. We show that global optimality can be reached in polynomial time and derive optimality conditions. Then we consider a more gen","authors_text":"Anthony Ephremides, Di Yuan, Qing He, Vangelis Angelakis","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2014-03-17T16:00:16Z","title":"Polynomial Complexity Minimum-Time Scheduling in a Class of Wireless Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1403.4144","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:95055ced2e7962d4ed293a87167758362c420ec7e9069b28961aeba71ae55eb7","target":"record","created_at":"2026-05-18T00:57:52Z","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":"33fa965f25c7bcfb92816ec3c9bb3e57b14e84c5fa99cd92cc86b598624b91a3","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2014-03-17T16:00:16Z","title_canon_sha256":"3f5fd8deed909e3851d1fcf47072529c8679c0c2c8078d188483135fa3449135"},"schema_version":"1.0","source":{"id":"1403.4144","kind":"arxiv","version":1}},"canonical_sha256":"fb7d1a0cc431475bbb74a2423c6527a08e58aec42861ecb350129fcc27043609","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"fb7d1a0cc431475bbb74a2423c6527a08e58aec42861ecb350129fcc27043609","first_computed_at":"2026-05-18T00:57:52.063419Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:57:52.063419Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ExWVJzAYlNP2Us+x+iVaNDfJGOr6pQNFTeGdfXkTQsgYdFMUTtG6kTPBG3u195rnIO7mUKl+9Zbm2/koNsKLCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:57:52.063990Z","signed_message":"canonical_sha256_bytes"},"source_id":"1403.4144","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:95055ced2e7962d4ed293a87167758362c420ec7e9069b28961aeba71ae55eb7","sha256:c4ffb83030b5ce04d2938f623a219d8845f1ed87ed7552d500bc0e4a9ec183c0"],"state_sha256":"1590170bda790b1e91450e07aece33e87de3f62c8fae54965c6c5f6b731e25e0"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KnUmVgvkiqpY7etydYSFmBr30K5bPXFzenwlZA4sKH409dvxCe9ch5Xx2TKVcrCuaPwoHcTm4MXbAx5lKTAXAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T07:17:44.876590Z","bundle_sha256":"a8a4320bfc69cbdc5b50ab0e4f00e1dd544c516412d72a635cfc8d6802f5015d"}}