{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:XG45ZOYRBQN5VU5BPMSQQXWWTY","short_pith_number":"pith:XG45ZOYR","canonical_record":{"source":{"id":"1405.6848","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-05-27T09:36:55Z","cross_cats_sorted":[],"title_canon_sha256":"9298306ab8b8d6105435713be9fdd0d62f7f21778253b7fb1a0e66bf321f110f","abstract_canon_sha256":"5dcf5801ed17b47f2eb6ec3c24b7e192b9a11350cdec2a0fad13cff4d9ea425d"},"schema_version":"1.0"},"canonical_sha256":"b9b9dcbb110c1bdad3a17b25085ed69e02be73b49370a67d5b59337c86729181","source":{"kind":"arxiv","id":"1405.6848","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1405.6848","created_at":"2026-05-18T01:30:15Z"},{"alias_kind":"arxiv_version","alias_value":"1405.6848v2","created_at":"2026-05-18T01:30:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1405.6848","created_at":"2026-05-18T01:30:15Z"},{"alias_kind":"pith_short_12","alias_value":"XG45ZOYRBQN5","created_at":"2026-05-18T12:28:57Z"},{"alias_kind":"pith_short_16","alias_value":"XG45ZOYRBQN5VU5B","created_at":"2026-05-18T12:28:57Z"},{"alias_kind":"pith_short_8","alias_value":"XG45ZOYR","created_at":"2026-05-18T12:28:57Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:XG45ZOYRBQN5VU5BPMSQQXWWTY","target":"record","payload":{"canonical_record":{"source":{"id":"1405.6848","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-05-27T09:36:55Z","cross_cats_sorted":[],"title_canon_sha256":"9298306ab8b8d6105435713be9fdd0d62f7f21778253b7fb1a0e66bf321f110f","abstract_canon_sha256":"5dcf5801ed17b47f2eb6ec3c24b7e192b9a11350cdec2a0fad13cff4d9ea425d"},"schema_version":"1.0"},"canonical_sha256":"b9b9dcbb110c1bdad3a17b25085ed69e02be73b49370a67d5b59337c86729181","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:30:15.584426Z","signature_b64":"NXaUMVxlyUOzwuwdgdl3F0Cdxhu9LrxPcXSU5M2H0qgTt4E6GNOJPzu3ed/FsenIyUqHvtekJf7Khdce3dnQAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b9b9dcbb110c1bdad3a17b25085ed69e02be73b49370a67d5b59337c86729181","last_reissued_at":"2026-05-18T01:30:15.583740Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:30:15.583740Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1405.6848","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-05-18T01:30:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"b7TWtFpzzKR8HSBVi6PrUTjfJ3A8QFlTCZwprsOqGGQfrcRDhr6QILshLU3WZNZP8IH2mNDRb2cvm4uKttz8Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T02:49:50.162448Z"},"content_sha256":"7b7bd1c82408380c3dfa12ea1148ccb9d76043635139ae542237ee464d5959fa","schema_version":"1.0","event_id":"sha256:7b7bd1c82408380c3dfa12ea1148ccb9d76043635139ae542237ee464d5959fa"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:XG45ZOYRBQN5VU5BPMSQQXWWTY","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Forwarding and optical indices of 4-regular circulant networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Hamid Mokhtar, Heng-Soon Gan, Sanming Zhou","submitted_at":"2014-05-27T09:36:55Z","abstract_excerpt":"An all-to-all routing in a graph $G$ is a set of oriented paths of $G$, with exactly one path for each ordered pair of vertices. The load of an edge under an all-to-all routing $R$ is the number of times it is used (in either direction) by paths of $R$, and the maximum load of an edge is denoted by $\\pi(G,R)$. The edge-forwarding index $\\pi(G)$ is the minimum of $\\pi(G,R)$ over all possible all-to-all routings $R$, and the arc-forwarding index $\\overrightarrow{\\pi}(G)$ is defined similarly by taking direction into consideration, where an arc is an ordered pair of adjacent vertices. Denote by $"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1405.6848","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":""},"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-18T01:30:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+SnGywClw1Em9TsF2elt6qcuD8HBr8WyoxnOGhyH0wPJ+czqjXTIxxuobQxubT+R7GX75Of/S26Ali3cF6R0Dg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T02:49:50.163102Z"},"content_sha256":"bd22e233c69f2c94ce7c32a5577dd669f8144250fb95222ad6574f82766b4404","schema_version":"1.0","event_id":"sha256:bd22e233c69f2c94ce7c32a5577dd669f8144250fb95222ad6574f82766b4404"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/XG45ZOYRBQN5VU5BPMSQQXWWTY/bundle.json","state_url":"https://pith.science/pith/XG45ZOYRBQN5VU5BPMSQQXWWTY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/XG45ZOYRBQN5VU5BPMSQQXWWTY/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-08T02:49:50Z","links":{"resolver":"https://pith.science/pith/XG45ZOYRBQN5VU5BPMSQQXWWTY","bundle":"https://pith.science/pith/XG45ZOYRBQN5VU5BPMSQQXWWTY/bundle.json","state":"https://pith.science/pith/XG45ZOYRBQN5VU5BPMSQQXWWTY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/XG45ZOYRBQN5VU5BPMSQQXWWTY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:XG45ZOYRBQN5VU5BPMSQQXWWTY","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":"5dcf5801ed17b47f2eb6ec3c24b7e192b9a11350cdec2a0fad13cff4d9ea425d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-05-27T09:36:55Z","title_canon_sha256":"9298306ab8b8d6105435713be9fdd0d62f7f21778253b7fb1a0e66bf321f110f"},"schema_version":"1.0","source":{"id":"1405.6848","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1405.6848","created_at":"2026-05-18T01:30:15Z"},{"alias_kind":"arxiv_version","alias_value":"1405.6848v2","created_at":"2026-05-18T01:30:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1405.6848","created_at":"2026-05-18T01:30:15Z"},{"alias_kind":"pith_short_12","alias_value":"XG45ZOYRBQN5","created_at":"2026-05-18T12:28:57Z"},{"alias_kind":"pith_short_16","alias_value":"XG45ZOYRBQN5VU5B","created_at":"2026-05-18T12:28:57Z"},{"alias_kind":"pith_short_8","alias_value":"XG45ZOYR","created_at":"2026-05-18T12:28:57Z"}],"graph_snapshots":[{"event_id":"sha256:bd22e233c69f2c94ce7c32a5577dd669f8144250fb95222ad6574f82766b4404","target":"graph","created_at":"2026-05-18T01:30:15Z","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":"An all-to-all routing in a graph $G$ is a set of oriented paths of $G$, with exactly one path for each ordered pair of vertices. The load of an edge under an all-to-all routing $R$ is the number of times it is used (in either direction) by paths of $R$, and the maximum load of an edge is denoted by $\\pi(G,R)$. The edge-forwarding index $\\pi(G)$ is the minimum of $\\pi(G,R)$ over all possible all-to-all routings $R$, and the arc-forwarding index $\\overrightarrow{\\pi}(G)$ is defined similarly by taking direction into consideration, where an arc is an ordered pair of adjacent vertices. Denote by $","authors_text":"Hamid Mokhtar, Heng-Soon Gan, Sanming Zhou","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-05-27T09:36:55Z","title":"Forwarding and optical indices of 4-regular circulant networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1405.6848","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:7b7bd1c82408380c3dfa12ea1148ccb9d76043635139ae542237ee464d5959fa","target":"record","created_at":"2026-05-18T01:30:15Z","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":"5dcf5801ed17b47f2eb6ec3c24b7e192b9a11350cdec2a0fad13cff4d9ea425d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-05-27T09:36:55Z","title_canon_sha256":"9298306ab8b8d6105435713be9fdd0d62f7f21778253b7fb1a0e66bf321f110f"},"schema_version":"1.0","source":{"id":"1405.6848","kind":"arxiv","version":2}},"canonical_sha256":"b9b9dcbb110c1bdad3a17b25085ed69e02be73b49370a67d5b59337c86729181","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b9b9dcbb110c1bdad3a17b25085ed69e02be73b49370a67d5b59337c86729181","first_computed_at":"2026-05-18T01:30:15.583740Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:30:15.583740Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"NXaUMVxlyUOzwuwdgdl3F0Cdxhu9LrxPcXSU5M2H0qgTt4E6GNOJPzu3ed/FsenIyUqHvtekJf7Khdce3dnQAg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:30:15.584426Z","signed_message":"canonical_sha256_bytes"},"source_id":"1405.6848","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7b7bd1c82408380c3dfa12ea1148ccb9d76043635139ae542237ee464d5959fa","sha256:bd22e233c69f2c94ce7c32a5577dd669f8144250fb95222ad6574f82766b4404"],"state_sha256":"e0a93a4f65e1c908db2f0986c2f669b2d32c9a18751b4a3e4f93bb2bdd84dcb8"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NwrT2Q2Xci/crJtI4MaZRKfynoO/6BsRjy4s82hfbgPTi1PV7TA3NEMV03zwqpq94Uj53F2VbeDnntGvF3SzAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-08T02:49:50.167177Z","bundle_sha256":"1dfb2db236f5e7723d3ebe40d2a7549eaa26aec56c88b8986a0114f91900691f"}}