{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:IJL3LUE566QJTPZWQF4UO6V6RD","short_pith_number":"pith:IJL3LUE5","canonical_record":{"source":{"id":"1905.04719","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2019-05-12T13:13:48Z","cross_cats_sorted":[],"title_canon_sha256":"6bd3e5880f5f3c4744d882949fe0907337439d8d389b60ba9ddffa8b88a510f2","abstract_canon_sha256":"97879b4afec5ef11898ed937f42c1e11550ee88340d5324343b792feb8323a0b"},"schema_version":"1.0"},"canonical_sha256":"4257b5d09df7a099bf368179477abe88f40f11ec23627fe75249c233f97fa774","source":{"kind":"arxiv","id":"1905.04719","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1905.04719","created_at":"2026-05-17T23:46:23Z"},{"alias_kind":"arxiv_version","alias_value":"1905.04719v1","created_at":"2026-05-17T23:46:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.04719","created_at":"2026-05-17T23:46:23Z"},{"alias_kind":"pith_short_12","alias_value":"IJL3LUE566QJ","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_16","alias_value":"IJL3LUE566QJTPZW","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_8","alias_value":"IJL3LUE5","created_at":"2026-05-18T12:33:18Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:IJL3LUE566QJTPZWQF4UO6V6RD","target":"record","payload":{"canonical_record":{"source":{"id":"1905.04719","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2019-05-12T13:13:48Z","cross_cats_sorted":[],"title_canon_sha256":"6bd3e5880f5f3c4744d882949fe0907337439d8d389b60ba9ddffa8b88a510f2","abstract_canon_sha256":"97879b4afec5ef11898ed937f42c1e11550ee88340d5324343b792feb8323a0b"},"schema_version":"1.0"},"canonical_sha256":"4257b5d09df7a099bf368179477abe88f40f11ec23627fe75249c233f97fa774","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:46:23.799262Z","signature_b64":"2Y6bMibs4inCvDl8P1FYjviIWGXHZXTORhZfpMCn/9HGtfVoT45lefuyO0jdLVWrCjHbiyw5+yc0MOyaWrryBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4257b5d09df7a099bf368179477abe88f40f11ec23627fe75249c233f97fa774","last_reissued_at":"2026-05-17T23:46:23.798775Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:46:23.798775Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1905.04719","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-17T23:46:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MV+KJrulZreC5ikkxZfMNso/i1XF85FG/YXdbWgHcTMNZrdMlgUlLJ49hWNsgiIzx+RDWcUZ5GwzG0fovcEvBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T07:18:52.448759Z"},"content_sha256":"b193929056a6c9ef5186a7537fc6a9ffc42854fa9310ea27b418a3cb82c174c4","schema_version":"1.0","event_id":"sha256:b193929056a6c9ef5186a7537fc6a9ffc42854fa9310ea27b418a3cb82c174c4"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:IJL3LUE566QJTPZWQF4UO6V6RD","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Routing and Scheduling of Network Flows with Deadlines and Discrete Capacity Allocation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DM","authors_text":"Di Yuan, Ghafour Ahani, Pawel Wiatr","submitted_at":"2019-05-12T13:13:48Z","abstract_excerpt":"Joint scheduling and routing of data flows with deadline constraints in communication networks has been attracting research interest. This type of problem distinguishes from conventional multicommodity flows due to the presence of the time dimension. In this paper, we address a flow routing and scheduling problem with delivery deadline, where the assignment of link capacity occurs in discrete units. Discrete capacity allocation is motivated by applications in communication systems, where it is common to have a base unit of capacity (e.g., wavelength channel in optical communications). We prese"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.04719","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-17T23:46:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/INFJ15yw36Wfrs8a6V6e/zYVo6x7bvQuIjniN+nIKGFUXG/KIXBII7mljui4l45/jvFHGQqLnJihmTjWAcEBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T07:18:52.449097Z"},"content_sha256":"99e894d390e6c46ab4f813af588a04161077ceb38c954f19cc5691581fb978b8","schema_version":"1.0","event_id":"sha256:99e894d390e6c46ab4f813af588a04161077ceb38c954f19cc5691581fb978b8"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/IJL3LUE566QJTPZWQF4UO6V6RD/bundle.json","state_url":"https://pith.science/pith/IJL3LUE566QJTPZWQF4UO6V6RD/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/IJL3LUE566QJTPZWQF4UO6V6RD/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:18:52Z","links":{"resolver":"https://pith.science/pith/IJL3LUE566QJTPZWQF4UO6V6RD","bundle":"https://pith.science/pith/IJL3LUE566QJTPZWQF4UO6V6RD/bundle.json","state":"https://pith.science/pith/IJL3LUE566QJTPZWQF4UO6V6RD/state.json","well_known_bundle":"https://pith.science/.well-known/pith/IJL3LUE566QJTPZWQF4UO6V6RD/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:IJL3LUE566QJTPZWQF4UO6V6RD","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":"97879b4afec5ef11898ed937f42c1e11550ee88340d5324343b792feb8323a0b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2019-05-12T13:13:48Z","title_canon_sha256":"6bd3e5880f5f3c4744d882949fe0907337439d8d389b60ba9ddffa8b88a510f2"},"schema_version":"1.0","source":{"id":"1905.04719","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1905.04719","created_at":"2026-05-17T23:46:23Z"},{"alias_kind":"arxiv_version","alias_value":"1905.04719v1","created_at":"2026-05-17T23:46:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.04719","created_at":"2026-05-17T23:46:23Z"},{"alias_kind":"pith_short_12","alias_value":"IJL3LUE566QJ","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_16","alias_value":"IJL3LUE566QJTPZW","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_8","alias_value":"IJL3LUE5","created_at":"2026-05-18T12:33:18Z"}],"graph_snapshots":[{"event_id":"sha256:99e894d390e6c46ab4f813af588a04161077ceb38c954f19cc5691581fb978b8","target":"graph","created_at":"2026-05-17T23:46:23Z","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":"Joint scheduling and routing of data flows with deadline constraints in communication networks has been attracting research interest. This type of problem distinguishes from conventional multicommodity flows due to the presence of the time dimension. In this paper, we address a flow routing and scheduling problem with delivery deadline, where the assignment of link capacity occurs in discrete units. Discrete capacity allocation is motivated by applications in communication systems, where it is common to have a base unit of capacity (e.g., wavelength channel in optical communications). We prese","authors_text":"Di Yuan, Ghafour Ahani, Pawel Wiatr","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2019-05-12T13:13:48Z","title":"Routing and Scheduling of Network Flows with Deadlines and Discrete Capacity Allocation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.04719","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:b193929056a6c9ef5186a7537fc6a9ffc42854fa9310ea27b418a3cb82c174c4","target":"record","created_at":"2026-05-17T23:46:23Z","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":"97879b4afec5ef11898ed937f42c1e11550ee88340d5324343b792feb8323a0b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2019-05-12T13:13:48Z","title_canon_sha256":"6bd3e5880f5f3c4744d882949fe0907337439d8d389b60ba9ddffa8b88a510f2"},"schema_version":"1.0","source":{"id":"1905.04719","kind":"arxiv","version":1}},"canonical_sha256":"4257b5d09df7a099bf368179477abe88f40f11ec23627fe75249c233f97fa774","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4257b5d09df7a099bf368179477abe88f40f11ec23627fe75249c233f97fa774","first_computed_at":"2026-05-17T23:46:23.798775Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:46:23.798775Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"2Y6bMibs4inCvDl8P1FYjviIWGXHZXTORhZfpMCn/9HGtfVoT45lefuyO0jdLVWrCjHbiyw5+yc0MOyaWrryBA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:46:23.799262Z","signed_message":"canonical_sha256_bytes"},"source_id":"1905.04719","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b193929056a6c9ef5186a7537fc6a9ffc42854fa9310ea27b418a3cb82c174c4","sha256:99e894d390e6c46ab4f813af588a04161077ceb38c954f19cc5691581fb978b8"],"state_sha256":"ea931407c6e0d72cb2b41735be302e1f9ddc2563a19c5399eda0c8a6ebe99117"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AbAqXsk+VX5a2RSMgKsMzGU5k/nAQ8OX9vN6H9xVxkVWRDJXpt3XQVmlKUhYeeX1aWK5ytBnJJ7wwtydn+SeDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T07:18:52.451047Z","bundle_sha256":"5f48c9c3af1c3c476959f27dd76f39dd514668eb2e254e3ecc3758d805f9cb43"}}