{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:M3JBBCVTEUUTAZXNGH6HV555CS","short_pith_number":"pith:M3JBBCVT","canonical_record":{"source":{"id":"1608.08773","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"math.CO","submitted_at":"2016-08-31T08:54:55Z","cross_cats_sorted":[],"title_canon_sha256":"9c0a26c5154a22f3b8644e5918c5bda3ba12ad9a04369d8f6eb0bfcf0bf45173","abstract_canon_sha256":"76e1d83fc31c904dda00f68a977eb188035b3a71df267cbb4d6da0fb769713f8"},"schema_version":"1.0"},"canonical_sha256":"66d2108ab325293066ed31fc7af7bd149165f4fd0b66c9169c052b5ebcf3523c","source":{"kind":"arxiv","id":"1608.08773","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1608.08773","created_at":"2026-05-18T01:06:39Z"},{"alias_kind":"arxiv_version","alias_value":"1608.08773v1","created_at":"2026-05-18T01:06:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1608.08773","created_at":"2026-05-18T01:06:39Z"},{"alias_kind":"pith_short_12","alias_value":"M3JBBCVTEUUT","created_at":"2026-05-18T12:30:29Z"},{"alias_kind":"pith_short_16","alias_value":"M3JBBCVTEUUTAZXN","created_at":"2026-05-18T12:30:29Z"},{"alias_kind":"pith_short_8","alias_value":"M3JBBCVT","created_at":"2026-05-18T12:30:29Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:M3JBBCVTEUUTAZXNGH6HV555CS","target":"record","payload":{"canonical_record":{"source":{"id":"1608.08773","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"math.CO","submitted_at":"2016-08-31T08:54:55Z","cross_cats_sorted":[],"title_canon_sha256":"9c0a26c5154a22f3b8644e5918c5bda3ba12ad9a04369d8f6eb0bfcf0bf45173","abstract_canon_sha256":"76e1d83fc31c904dda00f68a977eb188035b3a71df267cbb4d6da0fb769713f8"},"schema_version":"1.0"},"canonical_sha256":"66d2108ab325293066ed31fc7af7bd149165f4fd0b66c9169c052b5ebcf3523c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:06:39.947757Z","signature_b64":"uEwjJ9cuZovAG5ETXJ50EyhB8PwTU7BOxdV4AR9YmRznSuZ3mZY9BRKE8SOMUloj0Dxdn3v09TEyBEOy87DCBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"66d2108ab325293066ed31fc7af7bd149165f4fd0b66c9169c052b5ebcf3523c","last_reissued_at":"2026-05-18T01:06:39.947049Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:06:39.947049Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1608.08773","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-18T01:06:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tWEYuPChubEeHkImYhQy8eUsFCsx3piAfIqJCc8q62IpaQ7dL8eoYcKeJiBJcHsLO61dATfvUYp1aqJh9zsDAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T17:15:53.320650Z"},"content_sha256":"1ecb7bad205aed3eab564163120fd8ef86c3ce0b8c54fa98aad4869160d2ccbb","schema_version":"1.0","event_id":"sha256:1ecb7bad205aed3eab564163120fd8ef86c3ce0b8c54fa98aad4869160d2ccbb"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:M3JBBCVTEUUTAZXNGH6HV555CS","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Constructing Large-scale Low-latency Network from Small Optimal Networks","license":"http://creativecommons.org/licenses/by-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Ryosuke Mizuno, Yawara Ishida","submitted_at":"2016-08-31T08:54:55Z","abstract_excerpt":"The construction of large-scale, low-latency networks becomes difficult as the number of nodes increases. In general, the way to construct a theoretically optimal solution is unknown. However, it is known that some methods can construct suboptimal networks with low-latency. One such method is to construct large-scale networks from optimal or suboptimal small networks, using the product of graphs. There are two major advantages to this method. One is that we can reuse small, already known networks to construct large-scale networks. The other is that the networks obtained by this method have gra"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1608.08773","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-18T01:06:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FgKt0cIGT1REF4VdufvQFCec+rhysDAKtTkbiJlQ36bBGkolN5FahFS+DWIkyPSVTcQLTif80K9C8azatPGpBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T17:15:53.321487Z"},"content_sha256":"d39a44334aa737d090aa69c09bdcd0997ffae0102382d9dd46b312b3726c96dc","schema_version":"1.0","event_id":"sha256:d39a44334aa737d090aa69c09bdcd0997ffae0102382d9dd46b312b3726c96dc"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/M3JBBCVTEUUTAZXNGH6HV555CS/bundle.json","state_url":"https://pith.science/pith/M3JBBCVTEUUTAZXNGH6HV555CS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/M3JBBCVTEUUTAZXNGH6HV555CS/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-31T17:15:53Z","links":{"resolver":"https://pith.science/pith/M3JBBCVTEUUTAZXNGH6HV555CS","bundle":"https://pith.science/pith/M3JBBCVTEUUTAZXNGH6HV555CS/bundle.json","state":"https://pith.science/pith/M3JBBCVTEUUTAZXNGH6HV555CS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/M3JBBCVTEUUTAZXNGH6HV555CS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:M3JBBCVTEUUTAZXNGH6HV555CS","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":"76e1d83fc31c904dda00f68a977eb188035b3a71df267cbb4d6da0fb769713f8","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"math.CO","submitted_at":"2016-08-31T08:54:55Z","title_canon_sha256":"9c0a26c5154a22f3b8644e5918c5bda3ba12ad9a04369d8f6eb0bfcf0bf45173"},"schema_version":"1.0","source":{"id":"1608.08773","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1608.08773","created_at":"2026-05-18T01:06:39Z"},{"alias_kind":"arxiv_version","alias_value":"1608.08773v1","created_at":"2026-05-18T01:06:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1608.08773","created_at":"2026-05-18T01:06:39Z"},{"alias_kind":"pith_short_12","alias_value":"M3JBBCVTEUUT","created_at":"2026-05-18T12:30:29Z"},{"alias_kind":"pith_short_16","alias_value":"M3JBBCVTEUUTAZXN","created_at":"2026-05-18T12:30:29Z"},{"alias_kind":"pith_short_8","alias_value":"M3JBBCVT","created_at":"2026-05-18T12:30:29Z"}],"graph_snapshots":[{"event_id":"sha256:d39a44334aa737d090aa69c09bdcd0997ffae0102382d9dd46b312b3726c96dc","target":"graph","created_at":"2026-05-18T01:06:39Z","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":"The construction of large-scale, low-latency networks becomes difficult as the number of nodes increases. In general, the way to construct a theoretically optimal solution is unknown. However, it is known that some methods can construct suboptimal networks with low-latency. One such method is to construct large-scale networks from optimal or suboptimal small networks, using the product of graphs. There are two major advantages to this method. One is that we can reuse small, already known networks to construct large-scale networks. The other is that the networks obtained by this method have gra","authors_text":"Ryosuke Mizuno, Yawara Ishida","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"math.CO","submitted_at":"2016-08-31T08:54:55Z","title":"Constructing Large-scale Low-latency Network from Small Optimal Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1608.08773","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:1ecb7bad205aed3eab564163120fd8ef86c3ce0b8c54fa98aad4869160d2ccbb","target":"record","created_at":"2026-05-18T01:06:39Z","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":"76e1d83fc31c904dda00f68a977eb188035b3a71df267cbb4d6da0fb769713f8","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"math.CO","submitted_at":"2016-08-31T08:54:55Z","title_canon_sha256":"9c0a26c5154a22f3b8644e5918c5bda3ba12ad9a04369d8f6eb0bfcf0bf45173"},"schema_version":"1.0","source":{"id":"1608.08773","kind":"arxiv","version":1}},"canonical_sha256":"66d2108ab325293066ed31fc7af7bd149165f4fd0b66c9169c052b5ebcf3523c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"66d2108ab325293066ed31fc7af7bd149165f4fd0b66c9169c052b5ebcf3523c","first_computed_at":"2026-05-18T01:06:39.947049Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:06:39.947049Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"uEwjJ9cuZovAG5ETXJ50EyhB8PwTU7BOxdV4AR9YmRznSuZ3mZY9BRKE8SOMUloj0Dxdn3v09TEyBEOy87DCBA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:06:39.947757Z","signed_message":"canonical_sha256_bytes"},"source_id":"1608.08773","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1ecb7bad205aed3eab564163120fd8ef86c3ce0b8c54fa98aad4869160d2ccbb","sha256:d39a44334aa737d090aa69c09bdcd0997ffae0102382d9dd46b312b3726c96dc"],"state_sha256":"f394b15bd7a34fafed3dffbbf76d76761086b898c8df5ead2c871598e9cea66f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ojHZ1w/VyqCYQZfKYlcVff7V6V054ngr0lPcN2spWQkF9ZdHlzkuWm2qNENOMaAcdJmknhjFF6rQ+GUOJsNDAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T17:15:53.326303Z","bundle_sha256":"2fa36fc7f811def78d103e3323475427dcb0944ee5186d25961f73fb50bc8f35"}}