{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:HEPUHREZUYPRZKBUTDXKSX5K6E","short_pith_number":"pith:HEPUHREZ","canonical_record":{"source":{"id":"1407.0908","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-07-03T13:06:54Z","cross_cats_sorted":[],"title_canon_sha256":"518818678d16e1c3a36c5f3ba72de099245aa7547efde309039bc7b9d6384227","abstract_canon_sha256":"9bc2ea309ffe86321d260a8c5c4ee70d4d92a9a0f65cd3a15aaf83f9aa435b9b"},"schema_version":"1.0"},"canonical_sha256":"391f43c499a61f1ca83498eea95faaf115f9e51cc0dd0728469393e0ccd643b3","source":{"kind":"arxiv","id":"1407.0908","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1407.0908","created_at":"2026-05-18T02:48:25Z"},{"alias_kind":"arxiv_version","alias_value":"1407.0908v1","created_at":"2026-05-18T02:48:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1407.0908","created_at":"2026-05-18T02:48:25Z"},{"alias_kind":"pith_short_12","alias_value":"HEPUHREZUYPR","created_at":"2026-05-18T12:28:30Z"},{"alias_kind":"pith_short_16","alias_value":"HEPUHREZUYPRZKBU","created_at":"2026-05-18T12:28:30Z"},{"alias_kind":"pith_short_8","alias_value":"HEPUHREZ","created_at":"2026-05-18T12:28:30Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:HEPUHREZUYPRZKBUTDXKSX5K6E","target":"record","payload":{"canonical_record":{"source":{"id":"1407.0908","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-07-03T13:06:54Z","cross_cats_sorted":[],"title_canon_sha256":"518818678d16e1c3a36c5f3ba72de099245aa7547efde309039bc7b9d6384227","abstract_canon_sha256":"9bc2ea309ffe86321d260a8c5c4ee70d4d92a9a0f65cd3a15aaf83f9aa435b9b"},"schema_version":"1.0"},"canonical_sha256":"391f43c499a61f1ca83498eea95faaf115f9e51cc0dd0728469393e0ccd643b3","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:48:25.176215Z","signature_b64":"JBF+U7Euq/W5Y5fG0TyVJvTljrIZpNqh810pqzLci90ZwokLHDVD87sdF8C0j+N63eDWj64g9e12CqQhWBsJBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"391f43c499a61f1ca83498eea95faaf115f9e51cc0dd0728469393e0ccd643b3","last_reissued_at":"2026-05-18T02:48:25.175571Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:48:25.175571Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1407.0908","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-18T02:48:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gKyWuDDVGrSFe8rnrmRXFuxHFEaCAozsp22f/Kj3wZptPft0WVRVnpNf9cJ12NOdLZtykn4gk3TC6r8GSr5+BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T12:35:12.766341Z"},"content_sha256":"ef534ede664e18220a8f6238eccf50e1e9ba2441a6db5de7dc45585f794de2b6","schema_version":"1.0","event_id":"sha256:ef534ede664e18220a8f6238eccf50e1e9ba2441a6db5de7dc45585f794de2b6"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:HEPUHREZUYPRZKBUTDXKSX5K6E","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Network routing on regular directed graphs from spanning factorizations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Randall Dougherty, Vance Faber","submitted_at":"2014-07-03T13:06:54Z","abstract_excerpt":"Networks with a high degree of symmetry are useful models for parallel processor networks. In earlier papers, we defined several global communication tasks (universal exchange, universal broadcast, universal summation) that can be critical tasks when complex algorithms are mapped to parallel machines. We showed that utilizing the symmetry can make network optimization a tractable problem. In particular, we showed that Cayley graphs have the desirable property that certain routing schemes starting from a single node can be transferred to all nodes in a way that does not introduce conflicts. In "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1407.0908","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-18T02:48:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WPk0ED9oRp0NpAj7DyyqBfeh6GU+2F4mkJXHB/taKuebONaVycnU5F8ciTSLp7n9tULAkeadorPQ5NN3axwGDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T12:35:12.766688Z"},"content_sha256":"c787811bd1e76daa4a3bc4a7d9ce90e3bf939f2e99ade6a2f973142fe8e3c904","schema_version":"1.0","event_id":"sha256:c787811bd1e76daa4a3bc4a7d9ce90e3bf939f2e99ade6a2f973142fe8e3c904"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HEPUHREZUYPRZKBUTDXKSX5K6E/bundle.json","state_url":"https://pith.science/pith/HEPUHREZUYPRZKBUTDXKSX5K6E/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HEPUHREZUYPRZKBUTDXKSX5K6E/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-20T12:35:12Z","links":{"resolver":"https://pith.science/pith/HEPUHREZUYPRZKBUTDXKSX5K6E","bundle":"https://pith.science/pith/HEPUHREZUYPRZKBUTDXKSX5K6E/bundle.json","state":"https://pith.science/pith/HEPUHREZUYPRZKBUTDXKSX5K6E/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HEPUHREZUYPRZKBUTDXKSX5K6E/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:HEPUHREZUYPRZKBUTDXKSX5K6E","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":"9bc2ea309ffe86321d260a8c5c4ee70d4d92a9a0f65cd3a15aaf83f9aa435b9b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-07-03T13:06:54Z","title_canon_sha256":"518818678d16e1c3a36c5f3ba72de099245aa7547efde309039bc7b9d6384227"},"schema_version":"1.0","source":{"id":"1407.0908","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1407.0908","created_at":"2026-05-18T02:48:25Z"},{"alias_kind":"arxiv_version","alias_value":"1407.0908v1","created_at":"2026-05-18T02:48:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1407.0908","created_at":"2026-05-18T02:48:25Z"},{"alias_kind":"pith_short_12","alias_value":"HEPUHREZUYPR","created_at":"2026-05-18T12:28:30Z"},{"alias_kind":"pith_short_16","alias_value":"HEPUHREZUYPRZKBU","created_at":"2026-05-18T12:28:30Z"},{"alias_kind":"pith_short_8","alias_value":"HEPUHREZ","created_at":"2026-05-18T12:28:30Z"}],"graph_snapshots":[{"event_id":"sha256:c787811bd1e76daa4a3bc4a7d9ce90e3bf939f2e99ade6a2f973142fe8e3c904","target":"graph","created_at":"2026-05-18T02:48:25Z","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":"Networks with a high degree of symmetry are useful models for parallel processor networks. In earlier papers, we defined several global communication tasks (universal exchange, universal broadcast, universal summation) that can be critical tasks when complex algorithms are mapped to parallel machines. We showed that utilizing the symmetry can make network optimization a tractable problem. In particular, we showed that Cayley graphs have the desirable property that certain routing schemes starting from a single node can be transferred to all nodes in a way that does not introduce conflicts. In ","authors_text":"Randall Dougherty, Vance Faber","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-07-03T13:06:54Z","title":"Network routing on regular directed graphs from spanning factorizations"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1407.0908","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:ef534ede664e18220a8f6238eccf50e1e9ba2441a6db5de7dc45585f794de2b6","target":"record","created_at":"2026-05-18T02:48:25Z","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":"9bc2ea309ffe86321d260a8c5c4ee70d4d92a9a0f65cd3a15aaf83f9aa435b9b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-07-03T13:06:54Z","title_canon_sha256":"518818678d16e1c3a36c5f3ba72de099245aa7547efde309039bc7b9d6384227"},"schema_version":"1.0","source":{"id":"1407.0908","kind":"arxiv","version":1}},"canonical_sha256":"391f43c499a61f1ca83498eea95faaf115f9e51cc0dd0728469393e0ccd643b3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"391f43c499a61f1ca83498eea95faaf115f9e51cc0dd0728469393e0ccd643b3","first_computed_at":"2026-05-18T02:48:25.175571Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:48:25.175571Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"JBF+U7Euq/W5Y5fG0TyVJvTljrIZpNqh810pqzLci90ZwokLHDVD87sdF8C0j+N63eDWj64g9e12CqQhWBsJBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:48:25.176215Z","signed_message":"canonical_sha256_bytes"},"source_id":"1407.0908","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ef534ede664e18220a8f6238eccf50e1e9ba2441a6db5de7dc45585f794de2b6","sha256:c787811bd1e76daa4a3bc4a7d9ce90e3bf939f2e99ade6a2f973142fe8e3c904"],"state_sha256":"044856faa004ad80427602fc77b3df5a5026acd2a0b2798358d0fb6f1731dc12"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RZp99oxfj3eGY4y3QCz7UkuhxsGTaWjKCd2T5GSqdRdkmlJ6NJddmEXy2F4Aq3dz6byyYm4rlvQNFFdoIk3eDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-20T12:35:12.769069Z","bundle_sha256":"a6b61a94c425e1de03e787f6c1239d06b16ab699ced0198485453fe3c36f5fbc"}}