{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:R3ZDINOTVWWE7BE4PLRQOXOPKY","short_pith_number":"pith:R3ZDINOT","canonical_record":{"source":{"id":"1306.4917","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2013-06-20T15:41:22Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"06c93b6947f17951c4c185574859a7857419bd280776c4e7e6e79f7a4747c69e","abstract_canon_sha256":"257ac4f24ba5f4b116d0dc2b0319bce2ef33407a6c5980546787f8175688b722"},"schema_version":"1.0"},"canonical_sha256":"8ef23435d3adac4f849c7ae3075dcf563ba487ce280a7b572a0087bca654492f","source":{"kind":"arxiv","id":"1306.4917","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1306.4917","created_at":"2026-05-18T03:02:20Z"},{"alias_kind":"arxiv_version","alias_value":"1306.4917v1","created_at":"2026-05-18T03:02:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1306.4917","created_at":"2026-05-18T03:02:20Z"},{"alias_kind":"pith_short_12","alias_value":"R3ZDINOTVWWE","created_at":"2026-05-18T12:27:57Z"},{"alias_kind":"pith_short_16","alias_value":"R3ZDINOTVWWE7BE4","created_at":"2026-05-18T12:27:57Z"},{"alias_kind":"pith_short_8","alias_value":"R3ZDINOT","created_at":"2026-05-18T12:27:57Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:R3ZDINOTVWWE7BE4PLRQOXOPKY","target":"record","payload":{"canonical_record":{"source":{"id":"1306.4917","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2013-06-20T15:41:22Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"06c93b6947f17951c4c185574859a7857419bd280776c4e7e6e79f7a4747c69e","abstract_canon_sha256":"257ac4f24ba5f4b116d0dc2b0319bce2ef33407a6c5980546787f8175688b722"},"schema_version":"1.0"},"canonical_sha256":"8ef23435d3adac4f849c7ae3075dcf563ba487ce280a7b572a0087bca654492f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:02:20.933481Z","signature_b64":"MEdzCd70fU8OVoAPaD9s8unOEdSIxZJ81RSPM0/Gy7k4RY3Zw1aOce98wWC2sJVsdjZLqyK1fvqnl6zsnht6Bw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8ef23435d3adac4f849c7ae3075dcf563ba487ce280a7b572a0087bca654492f","last_reissued_at":"2026-05-18T03:02:20.932695Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:02:20.932695Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1306.4917","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:02:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cI7cE9DTPYyxWSI7QkhDXdQFLOJPPKDzhWIxOq60HXLzVG5FL862SFFdczOWty5zv2XfvKBwPiXRERM0CaiPCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T08:40:42.442839Z"},"content_sha256":"935fdb19b13b55cbb092da1ce1e5142343aed37e08f029f5c24cbaf40f92dfe4","schema_version":"1.0","event_id":"sha256:935fdb19b13b55cbb092da1ce1e5142343aed37e08f029f5c24cbaf40f92dfe4"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:R3ZDINOTVWWE7BE4PLRQOXOPKY","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Scheduling unit processing time arc shutdown jobs to maximize network flow over time: complexity results","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"cs.DM","authors_text":"Natashia Boland, Reena Kapoor, Simranjit Kaur, Thomas Kalinowski","submitted_at":"2013-06-20T15:41:22Z","abstract_excerpt":"We study the problem of scheduling maintenance on arcs of a capacitated network so as to maximize the total flow from a source node to a sink node over a set of time periods. Maintenance on an arc shuts down the arc for the duration of the period in which its maintenance is scheduled, making its capacity zero for that period. A set of arcs is designated to have maintenance during the planning period, which will require each to be shut down for exactly one time period. In general this problem is known to be NP-hard. Here we identify a number of characteristics that are relevant for the complexi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1306.4917","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:02:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KTEBfNC059rlI407uCtkYhc8+BxrODr2kNAtW7I+nRHeqrQXjJhD/U6Jy9NOSZ+/ISWCnRyDKrmWOcm/sL8lAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T08:40:42.443198Z"},"content_sha256":"dd4558638f2a8b6b493d98c2fbe92b608e03f2c998b94c75cfe76fd92d3067f7","schema_version":"1.0","event_id":"sha256:dd4558638f2a8b6b493d98c2fbe92b608e03f2c998b94c75cfe76fd92d3067f7"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/R3ZDINOTVWWE7BE4PLRQOXOPKY/bundle.json","state_url":"https://pith.science/pith/R3ZDINOTVWWE7BE4PLRQOXOPKY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/R3ZDINOTVWWE7BE4PLRQOXOPKY/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-31T08:40:42Z","links":{"resolver":"https://pith.science/pith/R3ZDINOTVWWE7BE4PLRQOXOPKY","bundle":"https://pith.science/pith/R3ZDINOTVWWE7BE4PLRQOXOPKY/bundle.json","state":"https://pith.science/pith/R3ZDINOTVWWE7BE4PLRQOXOPKY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/R3ZDINOTVWWE7BE4PLRQOXOPKY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:R3ZDINOTVWWE7BE4PLRQOXOPKY","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":"257ac4f24ba5f4b116d0dc2b0319bce2ef33407a6c5980546787f8175688b722","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2013-06-20T15:41:22Z","title_canon_sha256":"06c93b6947f17951c4c185574859a7857419bd280776c4e7e6e79f7a4747c69e"},"schema_version":"1.0","source":{"id":"1306.4917","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1306.4917","created_at":"2026-05-18T03:02:20Z"},{"alias_kind":"arxiv_version","alias_value":"1306.4917v1","created_at":"2026-05-18T03:02:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1306.4917","created_at":"2026-05-18T03:02:20Z"},{"alias_kind":"pith_short_12","alias_value":"R3ZDINOTVWWE","created_at":"2026-05-18T12:27:57Z"},{"alias_kind":"pith_short_16","alias_value":"R3ZDINOTVWWE7BE4","created_at":"2026-05-18T12:27:57Z"},{"alias_kind":"pith_short_8","alias_value":"R3ZDINOT","created_at":"2026-05-18T12:27:57Z"}],"graph_snapshots":[{"event_id":"sha256:dd4558638f2a8b6b493d98c2fbe92b608e03f2c998b94c75cfe76fd92d3067f7","target":"graph","created_at":"2026-05-18T03:02:20Z","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 study the problem of scheduling maintenance on arcs of a capacitated network so as to maximize the total flow from a source node to a sink node over a set of time periods. Maintenance on an arc shuts down the arc for the duration of the period in which its maintenance is scheduled, making its capacity zero for that period. A set of arcs is designated to have maintenance during the planning period, which will require each to be shut down for exactly one time period. In general this problem is known to be NP-hard. Here we identify a number of characteristics that are relevant for the complexi","authors_text":"Natashia Boland, Reena Kapoor, Simranjit Kaur, Thomas Kalinowski","cross_cats":["cs.CC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2013-06-20T15:41:22Z","title":"Scheduling unit processing time arc shutdown jobs to maximize network flow over time: complexity results"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1306.4917","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:935fdb19b13b55cbb092da1ce1e5142343aed37e08f029f5c24cbaf40f92dfe4","target":"record","created_at":"2026-05-18T03:02:20Z","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":"257ac4f24ba5f4b116d0dc2b0319bce2ef33407a6c5980546787f8175688b722","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2013-06-20T15:41:22Z","title_canon_sha256":"06c93b6947f17951c4c185574859a7857419bd280776c4e7e6e79f7a4747c69e"},"schema_version":"1.0","source":{"id":"1306.4917","kind":"arxiv","version":1}},"canonical_sha256":"8ef23435d3adac4f849c7ae3075dcf563ba487ce280a7b572a0087bca654492f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8ef23435d3adac4f849c7ae3075dcf563ba487ce280a7b572a0087bca654492f","first_computed_at":"2026-05-18T03:02:20.932695Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:02:20.932695Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"MEdzCd70fU8OVoAPaD9s8unOEdSIxZJ81RSPM0/Gy7k4RY3Zw1aOce98wWC2sJVsdjZLqyK1fvqnl6zsnht6Bw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:02:20.933481Z","signed_message":"canonical_sha256_bytes"},"source_id":"1306.4917","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:935fdb19b13b55cbb092da1ce1e5142343aed37e08f029f5c24cbaf40f92dfe4","sha256:dd4558638f2a8b6b493d98c2fbe92b608e03f2c998b94c75cfe76fd92d3067f7"],"state_sha256":"5e03917fc6389b78da0e03ce086532dbbb85ab0e2bd9ef2aa83451a7c5ac8f6d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TuQWCeBDPvPhFjORb2JcesFcc9YYMrqv7/lOtN/wrJxrKLmMjkOAa+fuNXV90nafiMH8sD6xb/7urPvfUcK8AA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T08:40:42.445591Z","bundle_sha256":"76cc9bcb8f6dcfe74cf2ea43df95a6b39681dbc7a61b6b11c69eb2cc5040dd42"}}