{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:7KPYFH6VCIF4YNEYCWLWI6YQE7","short_pith_number":"pith:7KPYFH6V","canonical_record":{"source":{"id":"1207.4589","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-07-19T09:21:48Z","cross_cats_sorted":["cs.NI","math.IT"],"title_canon_sha256":"3baa9bcac3f498a6f3ab1ca4d5811ed5200a2eec05279a4376791cc727790462","abstract_canon_sha256":"a2b3d022858b14d273d8f4526352b218075d515cdc3bf1dd246e254f956c6268"},"schema_version":"1.0"},"canonical_sha256":"fa9f829fd5120bcc34981597647b1027d115e163adf69384bf79fc6085c495a6","source":{"kind":"arxiv","id":"1207.4589","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1207.4589","created_at":"2026-05-18T03:50:36Z"},{"alias_kind":"arxiv_version","alias_value":"1207.4589v1","created_at":"2026-05-18T03:50:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1207.4589","created_at":"2026-05-18T03:50:36Z"},{"alias_kind":"pith_short_12","alias_value":"7KPYFH6VCIF4","created_at":"2026-05-18T12:26:58Z"},{"alias_kind":"pith_short_16","alias_value":"7KPYFH6VCIF4YNEY","created_at":"2026-05-18T12:26:58Z"},{"alias_kind":"pith_short_8","alias_value":"7KPYFH6V","created_at":"2026-05-18T12:26:58Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:7KPYFH6VCIF4YNEYCWLWI6YQE7","target":"record","payload":{"canonical_record":{"source":{"id":"1207.4589","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-07-19T09:21:48Z","cross_cats_sorted":["cs.NI","math.IT"],"title_canon_sha256":"3baa9bcac3f498a6f3ab1ca4d5811ed5200a2eec05279a4376791cc727790462","abstract_canon_sha256":"a2b3d022858b14d273d8f4526352b218075d515cdc3bf1dd246e254f956c6268"},"schema_version":"1.0"},"canonical_sha256":"fa9f829fd5120bcc34981597647b1027d115e163adf69384bf79fc6085c495a6","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:50:36.584660Z","signature_b64":"qEVXdN92QVK44RLrzfTXAmdyd4wb3b3ZtDfXxzh62YAEC1GfUWYUMefAg4YSWJRCXLgRnRtzjcBBizOlQVUODw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fa9f829fd5120bcc34981597647b1027d115e163adf69384bf79fc6085c495a6","last_reissued_at":"2026-05-18T03:50:36.583844Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:50:36.583844Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1207.4589","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-18T03:50:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6l3dhhCeyfEgULH+BvKS09/GgMfkwBufOJMQ4c/Ebp0ILoYGAzCR2XCbW4aAsCE+pxGv/WrprE1vEIS6othABA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T15:45:53.019676Z"},"content_sha256":"7548b04b782dfe451182d671064fdb63ab626b4323f45ef47039e1a72c650712","schema_version":"1.0","event_id":"sha256:7548b04b782dfe451182d671064fdb63ab626b4323f45ef47039e1a72c650712"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:7KPYFH6VCIF4YNEYCWLWI6YQE7","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Minimum-Length Scheduling with Finite Queues: Solution Characterization and Algorithmic Framework","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NI","math.IT"],"primary_cat":"cs.IT","authors_text":"Anthony Ephremides, Di Yuan, Qing He, Vangelis Angelakis","submitted_at":"2012-07-19T09:21:48Z","abstract_excerpt":"We consider a set of transmitter-receiver pairs, or links, that share a common channel and address the problem of emptying backlogged queues at the transmitters in minimum time. The problem amounts to determining activation subsets of links and their time durations to form a minimum-length schedule. The problem of scheduling has been studied under various formulations before. In this paper, we present fundamental insights and solution characterizations that include: (i) showing that the complexity of the problem remains high for any continuous and increasing rate function, (ii) formulating and"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1207.4589","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-18T03:50:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"P8EFFJHtwF+7rOAlvb/aiTQ0miF45ON9yF9BTymEJGGB/8kTcC2B9DYyvjYftvQ4xTuQ4thKHjXvqGnMUgWvBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T15:45:53.020364Z"},"content_sha256":"8bcab69b8a94921893fad919410090483c74b27c9735b8183a41b28d356264a5","schema_version":"1.0","event_id":"sha256:8bcab69b8a94921893fad919410090483c74b27c9735b8183a41b28d356264a5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7KPYFH6VCIF4YNEYCWLWI6YQE7/bundle.json","state_url":"https://pith.science/pith/7KPYFH6VCIF4YNEYCWLWI6YQE7/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7KPYFH6VCIF4YNEYCWLWI6YQE7/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-26T15:45:53Z","links":{"resolver":"https://pith.science/pith/7KPYFH6VCIF4YNEYCWLWI6YQE7","bundle":"https://pith.science/pith/7KPYFH6VCIF4YNEYCWLWI6YQE7/bundle.json","state":"https://pith.science/pith/7KPYFH6VCIF4YNEYCWLWI6YQE7/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7KPYFH6VCIF4YNEYCWLWI6YQE7/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:7KPYFH6VCIF4YNEYCWLWI6YQE7","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":"a2b3d022858b14d273d8f4526352b218075d515cdc3bf1dd246e254f956c6268","cross_cats_sorted":["cs.NI","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-07-19T09:21:48Z","title_canon_sha256":"3baa9bcac3f498a6f3ab1ca4d5811ed5200a2eec05279a4376791cc727790462"},"schema_version":"1.0","source":{"id":"1207.4589","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1207.4589","created_at":"2026-05-18T03:50:36Z"},{"alias_kind":"arxiv_version","alias_value":"1207.4589v1","created_at":"2026-05-18T03:50:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1207.4589","created_at":"2026-05-18T03:50:36Z"},{"alias_kind":"pith_short_12","alias_value":"7KPYFH6VCIF4","created_at":"2026-05-18T12:26:58Z"},{"alias_kind":"pith_short_16","alias_value":"7KPYFH6VCIF4YNEY","created_at":"2026-05-18T12:26:58Z"},{"alias_kind":"pith_short_8","alias_value":"7KPYFH6V","created_at":"2026-05-18T12:26:58Z"}],"graph_snapshots":[{"event_id":"sha256:8bcab69b8a94921893fad919410090483c74b27c9735b8183a41b28d356264a5","target":"graph","created_at":"2026-05-18T03:50:36Z","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 set of transmitter-receiver pairs, or links, that share a common channel and address the problem of emptying backlogged queues at the transmitters in minimum time. The problem amounts to determining activation subsets of links and their time durations to form a minimum-length schedule. The problem of scheduling has been studied under various formulations before. In this paper, we present fundamental insights and solution characterizations that include: (i) showing that the complexity of the problem remains high for any continuous and increasing rate function, (ii) formulating and","authors_text":"Anthony Ephremides, Di Yuan, Qing He, Vangelis Angelakis","cross_cats":["cs.NI","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-07-19T09:21:48Z","title":"Minimum-Length Scheduling with Finite Queues: Solution Characterization and Algorithmic Framework"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1207.4589","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:7548b04b782dfe451182d671064fdb63ab626b4323f45ef47039e1a72c650712","target":"record","created_at":"2026-05-18T03:50:36Z","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":"a2b3d022858b14d273d8f4526352b218075d515cdc3bf1dd246e254f956c6268","cross_cats_sorted":["cs.NI","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-07-19T09:21:48Z","title_canon_sha256":"3baa9bcac3f498a6f3ab1ca4d5811ed5200a2eec05279a4376791cc727790462"},"schema_version":"1.0","source":{"id":"1207.4589","kind":"arxiv","version":1}},"canonical_sha256":"fa9f829fd5120bcc34981597647b1027d115e163adf69384bf79fc6085c495a6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"fa9f829fd5120bcc34981597647b1027d115e163adf69384bf79fc6085c495a6","first_computed_at":"2026-05-18T03:50:36.583844Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:50:36.583844Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"qEVXdN92QVK44RLrzfTXAmdyd4wb3b3ZtDfXxzh62YAEC1GfUWYUMefAg4YSWJRCXLgRnRtzjcBBizOlQVUODw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:50:36.584660Z","signed_message":"canonical_sha256_bytes"},"source_id":"1207.4589","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7548b04b782dfe451182d671064fdb63ab626b4323f45ef47039e1a72c650712","sha256:8bcab69b8a94921893fad919410090483c74b27c9735b8183a41b28d356264a5"],"state_sha256":"5c6606919b1c74f68c5abb0b1ed301da3d290bd73b7cd2675df13d68215ee19e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xkEm67KtjbHITjMUM5qJeHvV3tky77amjNXYIFOUd7TN9336jDika3YClZg/qbYBCp1ZwoO+gTk8rcdIHMLwAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T15:45:53.024056Z","bundle_sha256":"0c85143b4673b9b531f4e687a508357e72a1c77f24f7db721000cec2dcafe69e"}}