{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2022:33OIAYJAQZ7JCM45SWX7DWMFPB","short_pith_number":"pith:33OIAYJA","canonical_record":{"source":{"id":"2210.05333","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DC","submitted_at":"2022-10-11T10:53:12Z","cross_cats_sorted":[],"title_canon_sha256":"6a0b4f348e5d42075d59783fad396f3d57dde38d0eb246e7341ce6ee80415d22","abstract_canon_sha256":"0366969410c2c45aaf538358972bf1986a1bc11bc7663bc6ebd1eb63517e6a67"},"schema_version":"1.0"},"canonical_sha256":"dedc806120867e91339d95aff1d985786b0d4fcac1699e599ed3278f91815133","source":{"kind":"arxiv","id":"2210.05333","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2210.05333","created_at":"2026-07-05T05:50:09Z"},{"alias_kind":"arxiv_version","alias_value":"2210.05333v2","created_at":"2026-07-05T05:50:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2210.05333","created_at":"2026-07-05T05:50:09Z"},{"alias_kind":"pith_short_12","alias_value":"33OIAYJAQZ7J","created_at":"2026-07-05T05:50:09Z"},{"alias_kind":"pith_short_16","alias_value":"33OIAYJAQZ7JCM45","created_at":"2026-07-05T05:50:09Z"},{"alias_kind":"pith_short_8","alias_value":"33OIAYJA","created_at":"2026-07-05T05:50:09Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2022:33OIAYJAQZ7JCM45SWX7DWMFPB","target":"record","payload":{"canonical_record":{"source":{"id":"2210.05333","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DC","submitted_at":"2022-10-11T10:53:12Z","cross_cats_sorted":[],"title_canon_sha256":"6a0b4f348e5d42075d59783fad396f3d57dde38d0eb246e7341ce6ee80415d22","abstract_canon_sha256":"0366969410c2c45aaf538358972bf1986a1bc11bc7663bc6ebd1eb63517e6a67"},"schema_version":"1.0"},"canonical_sha256":"dedc806120867e91339d95aff1d985786b0d4fcac1699e599ed3278f91815133","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:50:09.428079Z","signature_b64":"uoDaIsQKxsBvWbf/5kXXWtoxOs86g+JtQTCGT6AsHA9jqrhiJIccUuofFmIHY5Mq0LQzgP5mq3kA2Lv8GuvABA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"dedc806120867e91339d95aff1d985786b0d4fcac1699e599ed3278f91815133","last_reissued_at":"2026-07-05T05:50:09.427567Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:50:09.427567Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2210.05333","source_version":2,"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-07-05T05:50:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"01c4jzi3LHjjIbpF66OaVI3lyxTxM5/AjocSncfi1Cdb1QSpV4xxNa4wIacSSvvHFEJmyFDLB3ZkNZTA2teZBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-09T05:58:14.371966Z"},"content_sha256":"a6458a7e20fcc6f9deed2d3502946614c226703c8361c45629554079e63b2a80","schema_version":"1.0","event_id":"sha256:a6458a7e20fcc6f9deed2d3502946614c226703c8361c45629554079e63b2a80"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2022:33OIAYJAQZ7JCM45SWX7DWMFPB","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Routing Schemes for Hybrid Communication Networks","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Artur Czumaj, Christian Scheideler, Julian Werthmann, Philipp Schneider, Sam Coy","submitted_at":"2022-10-11T10:53:12Z","abstract_excerpt":"We consider the problem of computing routing schemes in the $\\mathsf{HYBRID}$ model of distributed computing where nodes have access to two fundamentally different communication modes. In this problem nodes have to compute small labels and routing tables that allow for efficient routing of messages in the local network, which typically offers the majority of the throughput. Recent work has shown that using the $\\mathsf{HYBRID}$ model admits a significant speed-up compared to what would be possible if either communication mode were used in isolation. Nonetheless, if general graphs are used as t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2210.05333","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2210.05333/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T05:50:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cQwNsivDPjThGkE5Lsf9Ps8oRIv4IizYLQskHQo7okMgFe1Z35Ijl9LmQgjWJs+XKFUBPIgYBWALE9k0pX7JBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-09T05:58:14.372355Z"},"content_sha256":"8eeae31fdc080ebc054a2a9664ded71018dd494bafb999a03ceb8016a359507b","schema_version":"1.0","event_id":"sha256:8eeae31fdc080ebc054a2a9664ded71018dd494bafb999a03ceb8016a359507b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/33OIAYJAQZ7JCM45SWX7DWMFPB/bundle.json","state_url":"https://pith.science/pith/33OIAYJAQZ7JCM45SWX7DWMFPB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/33OIAYJAQZ7JCM45SWX7DWMFPB/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-07-09T05:58:14Z","links":{"resolver":"https://pith.science/pith/33OIAYJAQZ7JCM45SWX7DWMFPB","bundle":"https://pith.science/pith/33OIAYJAQZ7JCM45SWX7DWMFPB/bundle.json","state":"https://pith.science/pith/33OIAYJAQZ7JCM45SWX7DWMFPB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/33OIAYJAQZ7JCM45SWX7DWMFPB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2022:33OIAYJAQZ7JCM45SWX7DWMFPB","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":"0366969410c2c45aaf538358972bf1986a1bc11bc7663bc6ebd1eb63517e6a67","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DC","submitted_at":"2022-10-11T10:53:12Z","title_canon_sha256":"6a0b4f348e5d42075d59783fad396f3d57dde38d0eb246e7341ce6ee80415d22"},"schema_version":"1.0","source":{"id":"2210.05333","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2210.05333","created_at":"2026-07-05T05:50:09Z"},{"alias_kind":"arxiv_version","alias_value":"2210.05333v2","created_at":"2026-07-05T05:50:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2210.05333","created_at":"2026-07-05T05:50:09Z"},{"alias_kind":"pith_short_12","alias_value":"33OIAYJAQZ7J","created_at":"2026-07-05T05:50:09Z"},{"alias_kind":"pith_short_16","alias_value":"33OIAYJAQZ7JCM45","created_at":"2026-07-05T05:50:09Z"},{"alias_kind":"pith_short_8","alias_value":"33OIAYJA","created_at":"2026-07-05T05:50:09Z"}],"graph_snapshots":[{"event_id":"sha256:8eeae31fdc080ebc054a2a9664ded71018dd494bafb999a03ceb8016a359507b","target":"graph","created_at":"2026-07-05T05:50:09Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2210.05333/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We consider the problem of computing routing schemes in the $\\mathsf{HYBRID}$ model of distributed computing where nodes have access to two fundamentally different communication modes. In this problem nodes have to compute small labels and routing tables that allow for efficient routing of messages in the local network, which typically offers the majority of the throughput. Recent work has shown that using the $\\mathsf{HYBRID}$ model admits a significant speed-up compared to what would be possible if either communication mode were used in isolation. Nonetheless, if general graphs are used as t","authors_text":"Artur Czumaj, Christian Scheideler, Julian Werthmann, Philipp Schneider, Sam Coy","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DC","submitted_at":"2022-10-11T10:53:12Z","title":"Routing Schemes for Hybrid Communication Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2210.05333","kind":"arxiv","version":2},"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:a6458a7e20fcc6f9deed2d3502946614c226703c8361c45629554079e63b2a80","target":"record","created_at":"2026-07-05T05:50:09Z","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":"0366969410c2c45aaf538358972bf1986a1bc11bc7663bc6ebd1eb63517e6a67","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DC","submitted_at":"2022-10-11T10:53:12Z","title_canon_sha256":"6a0b4f348e5d42075d59783fad396f3d57dde38d0eb246e7341ce6ee80415d22"},"schema_version":"1.0","source":{"id":"2210.05333","kind":"arxiv","version":2}},"canonical_sha256":"dedc806120867e91339d95aff1d985786b0d4fcac1699e599ed3278f91815133","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"dedc806120867e91339d95aff1d985786b0d4fcac1699e599ed3278f91815133","first_computed_at":"2026-07-05T05:50:09.427567Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T05:50:09.427567Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"uoDaIsQKxsBvWbf/5kXXWtoxOs86g+JtQTCGT6AsHA9jqrhiJIccUuofFmIHY5Mq0LQzgP5mq3kA2Lv8GuvABA==","signature_status":"signed_v1","signed_at":"2026-07-05T05:50:09.428079Z","signed_message":"canonical_sha256_bytes"},"source_id":"2210.05333","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a6458a7e20fcc6f9deed2d3502946614c226703c8361c45629554079e63b2a80","sha256:8eeae31fdc080ebc054a2a9664ded71018dd494bafb999a03ceb8016a359507b"],"state_sha256":"a8fcc6016eb2ed24ca4f98e1622429d602d1857c95cb449886a7c8e149167556"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"e4V+VsztcYmEJjcl2Q4EfpMT/J1jCCsgSP2SH+lbi1LQSQ9c5pazXvgSZ6q2r5EaTnBsK5czWrKckMqdmk0CDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-09T05:58:14.374939Z","bundle_sha256":"a4da374d94554a449bf850db0f30c5df5dd00e51b46ec6b0f4a67b623ba56252"}}