{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:GB2Q6J7MDJHMFXZLA6U3MG3P45","short_pith_number":"pith:GB2Q6J7M","canonical_record":{"source":{"id":"1905.02800","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-05-07T20:40:29Z","cross_cats_sorted":[],"title_canon_sha256":"4c23c54622ee57ec546de63efc30e0955505b792420a09e9d77143b0ed67c4c3","abstract_canon_sha256":"059bb4e4a3907b7b8fca79088636a4535ecde13dd1a2bfa19c3f345c6b5979e2"},"schema_version":"1.0"},"canonical_sha256":"30750f27ec1a4ec2df2b07a9b61b6fe747416f732bfa0f112e8983d8acef2f1b","source":{"kind":"arxiv","id":"1905.02800","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1905.02800","created_at":"2026-05-17T23:46:45Z"},{"alias_kind":"arxiv_version","alias_value":"1905.02800v1","created_at":"2026-05-17T23:46:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.02800","created_at":"2026-05-17T23:46:45Z"},{"alias_kind":"pith_short_12","alias_value":"GB2Q6J7MDJHM","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_16","alias_value":"GB2Q6J7MDJHMFXZL","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_8","alias_value":"GB2Q6J7M","created_at":"2026-05-18T12:33:18Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:GB2Q6J7MDJHMFXZLA6U3MG3P45","target":"record","payload":{"canonical_record":{"source":{"id":"1905.02800","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-05-07T20:40:29Z","cross_cats_sorted":[],"title_canon_sha256":"4c23c54622ee57ec546de63efc30e0955505b792420a09e9d77143b0ed67c4c3","abstract_canon_sha256":"059bb4e4a3907b7b8fca79088636a4535ecde13dd1a2bfa19c3f345c6b5979e2"},"schema_version":"1.0"},"canonical_sha256":"30750f27ec1a4ec2df2b07a9b61b6fe747416f732bfa0f112e8983d8acef2f1b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:46:45.370194Z","signature_b64":"Krxr6amv0Hx2qCYjxBkuV5BdsZCP6EqZFu/Vl43WNJ4D28yVssm8ITECwSDo90mgJlXO6QFNybEnGd//zSRWBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"30750f27ec1a4ec2df2b07a9b61b6fe747416f732bfa0f112e8983d8acef2f1b","last_reissued_at":"2026-05-17T23:46:45.369766Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:46:45.369766Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1905.02800","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:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"r6avnuFkcekEQda50h7JoHwlWAQ0qse4nAWbktPH+j5hqvBOIxiRu6bzS+5Ejr+BqiCzeiGFccKhJia10XPEAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T18:16:32.634029Z"},"content_sha256":"b51b2a8cf02f51ae668e0b9e68162c1a2a73d446c103caa5c0352b3ea556dfd7","schema_version":"1.0","event_id":"sha256:b51b2a8cf02f51ae668e0b9e68162c1a2a73d446c103caa5c0352b3ea556dfd7"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:GB2Q6J7MDJHMFXZLA6U3MG3P45","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Online and Offline Greedy Algorithms for Routing with Switching Costs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Mohit Singh, Roy Schwartz, Sina Yazdanbod","submitted_at":"2019-05-07T20:40:29Z","abstract_excerpt":"Motivated by the use of high speed circuit switches in large scale data centers, we consider the problem of circuit switch scheduling. In this problem we are given demands between pairs of servers and the goal is to schedule at every time step a matching between the servers while maximizing the total satisfied demand over time. The crux of this scheduling problem is that once one shifts from one matching to a different one a fixed delay $\\delta$ is incurred during which no data can be transmitted.\n  For the offline version of the problem we present a $(1-\\frac{1}{e}-\\epsilon)$ approximation ra"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.02800","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:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fmZ4YE623tk5RWwaUQ/wKEJhVg4y74J89FMIwZO71zj2xeR0FhpHVvSUA3MoW8AaZ5acCSnjWdP7jFL+cUbRAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T18:16:32.634395Z"},"content_sha256":"c8a4cfd6ccd45d75d5653a9d45717df17f263bb9fc203db9cefc60657d65743a","schema_version":"1.0","event_id":"sha256:c8a4cfd6ccd45d75d5653a9d45717df17f263bb9fc203db9cefc60657d65743a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GB2Q6J7MDJHMFXZLA6U3MG3P45/bundle.json","state_url":"https://pith.science/pith/GB2Q6J7MDJHMFXZLA6U3MG3P45/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GB2Q6J7MDJHMFXZLA6U3MG3P45/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-10T18:16:32Z","links":{"resolver":"https://pith.science/pith/GB2Q6J7MDJHMFXZLA6U3MG3P45","bundle":"https://pith.science/pith/GB2Q6J7MDJHMFXZLA6U3MG3P45/bundle.json","state":"https://pith.science/pith/GB2Q6J7MDJHMFXZLA6U3MG3P45/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GB2Q6J7MDJHMFXZLA6U3MG3P45/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:GB2Q6J7MDJHMFXZLA6U3MG3P45","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":"059bb4e4a3907b7b8fca79088636a4535ecde13dd1a2bfa19c3f345c6b5979e2","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-05-07T20:40:29Z","title_canon_sha256":"4c23c54622ee57ec546de63efc30e0955505b792420a09e9d77143b0ed67c4c3"},"schema_version":"1.0","source":{"id":"1905.02800","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1905.02800","created_at":"2026-05-17T23:46:45Z"},{"alias_kind":"arxiv_version","alias_value":"1905.02800v1","created_at":"2026-05-17T23:46:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.02800","created_at":"2026-05-17T23:46:45Z"},{"alias_kind":"pith_short_12","alias_value":"GB2Q6J7MDJHM","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_16","alias_value":"GB2Q6J7MDJHMFXZL","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_8","alias_value":"GB2Q6J7M","created_at":"2026-05-18T12:33:18Z"}],"graph_snapshots":[{"event_id":"sha256:c8a4cfd6ccd45d75d5653a9d45717df17f263bb9fc203db9cefc60657d65743a","target":"graph","created_at":"2026-05-17T23:46:45Z","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":"Motivated by the use of high speed circuit switches in large scale data centers, we consider the problem of circuit switch scheduling. In this problem we are given demands between pairs of servers and the goal is to schedule at every time step a matching between the servers while maximizing the total satisfied demand over time. The crux of this scheduling problem is that once one shifts from one matching to a different one a fixed delay $\\delta$ is incurred during which no data can be transmitted.\n  For the offline version of the problem we present a $(1-\\frac{1}{e}-\\epsilon)$ approximation ra","authors_text":"Mohit Singh, Roy Schwartz, Sina Yazdanbod","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-05-07T20:40:29Z","title":"Online and Offline Greedy Algorithms for Routing with Switching Costs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.02800","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:b51b2a8cf02f51ae668e0b9e68162c1a2a73d446c103caa5c0352b3ea556dfd7","target":"record","created_at":"2026-05-17T23:46:45Z","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":"059bb4e4a3907b7b8fca79088636a4535ecde13dd1a2bfa19c3f345c6b5979e2","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-05-07T20:40:29Z","title_canon_sha256":"4c23c54622ee57ec546de63efc30e0955505b792420a09e9d77143b0ed67c4c3"},"schema_version":"1.0","source":{"id":"1905.02800","kind":"arxiv","version":1}},"canonical_sha256":"30750f27ec1a4ec2df2b07a9b61b6fe747416f732bfa0f112e8983d8acef2f1b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"30750f27ec1a4ec2df2b07a9b61b6fe747416f732bfa0f112e8983d8acef2f1b","first_computed_at":"2026-05-17T23:46:45.369766Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:46:45.369766Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Krxr6amv0Hx2qCYjxBkuV5BdsZCP6EqZFu/Vl43WNJ4D28yVssm8ITECwSDo90mgJlXO6QFNybEnGd//zSRWBg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:46:45.370194Z","signed_message":"canonical_sha256_bytes"},"source_id":"1905.02800","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b51b2a8cf02f51ae668e0b9e68162c1a2a73d446c103caa5c0352b3ea556dfd7","sha256:c8a4cfd6ccd45d75d5653a9d45717df17f263bb9fc203db9cefc60657d65743a"],"state_sha256":"6cd58b01dfd921125818b3cec4a3041b68969b8f4f8d67bd904bafce276bc40d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zlx8RrFwUhpnQFXITCNrpB+DJGdUrS8A2zxpVa/jdoJi8AmacSB/Yu6qjB/X2c5pxGhqFGnGsI7VtNVJ2N4EDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-10T18:16:32.636741Z","bundle_sha256":"6d9509e1c75158324884b4fe96d02bb1fe85b0553050cf3cdcd9f4059dea71aa"}}