{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:4LPKSSOLGMKMU5D3O27W455XW3","short_pith_number":"pith:4LPKSSOL","canonical_record":{"source":{"id":"1606.05119","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2016-06-16T10:04:18Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"b2cb7262bcb4ad61bffc9731c4a5bf71072cfcf94ef0093ccf99dda4263b7631","abstract_canon_sha256":"140e69ec629be668cb9a53adba80b5443ebfa75eaffc3001b5e9e854ad6e349d"},"schema_version":"1.0"},"canonical_sha256":"e2dea949cb3314ca747b76bf6e77b7b6df37ff203dca3fe74aba4f2e4401a935","source":{"kind":"arxiv","id":"1606.05119","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1606.05119","created_at":"2026-05-18T01:12:21Z"},{"alias_kind":"arxiv_version","alias_value":"1606.05119v1","created_at":"2026-05-18T01:12:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1606.05119","created_at":"2026-05-18T01:12:21Z"},{"alias_kind":"pith_short_12","alias_value":"4LPKSSOLGMKM","created_at":"2026-05-18T12:29:58Z"},{"alias_kind":"pith_short_16","alias_value":"4LPKSSOLGMKMU5D3","created_at":"2026-05-18T12:29:58Z"},{"alias_kind":"pith_short_8","alias_value":"4LPKSSOL","created_at":"2026-05-18T12:29:58Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:4LPKSSOLGMKMU5D3O27W455XW3","target":"record","payload":{"canonical_record":{"source":{"id":"1606.05119","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2016-06-16T10:04:18Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"b2cb7262bcb4ad61bffc9731c4a5bf71072cfcf94ef0093ccf99dda4263b7631","abstract_canon_sha256":"140e69ec629be668cb9a53adba80b5443ebfa75eaffc3001b5e9e854ad6e349d"},"schema_version":"1.0"},"canonical_sha256":"e2dea949cb3314ca747b76bf6e77b7b6df37ff203dca3fe74aba4f2e4401a935","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:12:21.980924Z","signature_b64":"1G8YrtQUVcZtEVhOwBYAkqUnOIfkQWD/u1hfyrUwONe42TxaOs8ROS/H2FJqryH3Ra5SofFiuODAKix9noZMDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e2dea949cb3314ca747b76bf6e77b7b6df37ff203dca3fe74aba4f2e4401a935","last_reissued_at":"2026-05-18T01:12:21.980607Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:12:21.980607Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1606.05119","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:12:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Pk4y9pL8uFA2EFdUwrs1t/Y9haGPp/xwAdWdpbknHd9MGLyn896JjBS4AuYrE1GHnO/x8THKPyn99wReOY4rDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T17:23:55.363952Z"},"content_sha256":"f3dfaaad2cfaa20f3b68adecc54e507a4d9c12b5c2160b534c30c51b3833b1c4","schema_version":"1.0","event_id":"sha256:f3dfaaad2cfaa20f3b68adecc54e507a4d9c12b5c2160b534c30c51b3833b1c4"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:4LPKSSOLGMKMU5D3O27W455XW3","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Average Shortest Path Length of Graphs of Diameter 3","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.DM","authors_text":"Nobutaka Shimizu, Ryuhei Mori","submitted_at":"2016-06-16T10:04:18Z","abstract_excerpt":"A network topology with low average shortest path length (ASPL) provides efficient data transmission while the number of nodes and the number of links incident to each node are often limited due to physical constraints. In this paper, we consider the construction of low ASPL graphs under these constraints by using stochastic local search (SLS) algorithms. Since the ASPL cannot be calculated efficiently, the ASPL is not suitable for the evaluation function of SLS algorithms. We first derive an equality and bounds for the ASPL of graphs of diameter 3. Then, we propose use the simpliest upper bou"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1606.05119","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:12:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9ue2mPCsqnJ9khJRkn80PE4rzPntENmu0zI/CtlSj9GerDDZ+ab8nP+tegUoNXVSf7Tux87LPOW0b8tQDS9BAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T17:23:55.364307Z"},"content_sha256":"75f1820aee273883dd785f58a69fb78ea9394a08689905a8cb8db86956d6ebe4","schema_version":"1.0","event_id":"sha256:75f1820aee273883dd785f58a69fb78ea9394a08689905a8cb8db86956d6ebe4"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4LPKSSOLGMKMU5D3O27W455XW3/bundle.json","state_url":"https://pith.science/pith/4LPKSSOLGMKMU5D3O27W455XW3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4LPKSSOLGMKMU5D3O27W455XW3/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-26T17:23:55Z","links":{"resolver":"https://pith.science/pith/4LPKSSOLGMKMU5D3O27W455XW3","bundle":"https://pith.science/pith/4LPKSSOLGMKMU5D3O27W455XW3/bundle.json","state":"https://pith.science/pith/4LPKSSOLGMKMU5D3O27W455XW3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4LPKSSOLGMKMU5D3O27W455XW3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:4LPKSSOLGMKMU5D3O27W455XW3","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":"140e69ec629be668cb9a53adba80b5443ebfa75eaffc3001b5e9e854ad6e349d","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2016-06-16T10:04:18Z","title_canon_sha256":"b2cb7262bcb4ad61bffc9731c4a5bf71072cfcf94ef0093ccf99dda4263b7631"},"schema_version":"1.0","source":{"id":"1606.05119","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1606.05119","created_at":"2026-05-18T01:12:21Z"},{"alias_kind":"arxiv_version","alias_value":"1606.05119v1","created_at":"2026-05-18T01:12:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1606.05119","created_at":"2026-05-18T01:12:21Z"},{"alias_kind":"pith_short_12","alias_value":"4LPKSSOLGMKM","created_at":"2026-05-18T12:29:58Z"},{"alias_kind":"pith_short_16","alias_value":"4LPKSSOLGMKMU5D3","created_at":"2026-05-18T12:29:58Z"},{"alias_kind":"pith_short_8","alias_value":"4LPKSSOL","created_at":"2026-05-18T12:29:58Z"}],"graph_snapshots":[{"event_id":"sha256:75f1820aee273883dd785f58a69fb78ea9394a08689905a8cb8db86956d6ebe4","target":"graph","created_at":"2026-05-18T01:12:21Z","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":"A network topology with low average shortest path length (ASPL) provides efficient data transmission while the number of nodes and the number of links incident to each node are often limited due to physical constraints. In this paper, we consider the construction of low ASPL graphs under these constraints by using stochastic local search (SLS) algorithms. Since the ASPL cannot be calculated efficiently, the ASPL is not suitable for the evaluation function of SLS algorithms. We first derive an equality and bounds for the ASPL of graphs of diameter 3. Then, we propose use the simpliest upper bou","authors_text":"Nobutaka Shimizu, Ryuhei Mori","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2016-06-16T10:04:18Z","title":"Average Shortest Path Length of Graphs of Diameter 3"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1606.05119","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:f3dfaaad2cfaa20f3b68adecc54e507a4d9c12b5c2160b534c30c51b3833b1c4","target":"record","created_at":"2026-05-18T01:12:21Z","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":"140e69ec629be668cb9a53adba80b5443ebfa75eaffc3001b5e9e854ad6e349d","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2016-06-16T10:04:18Z","title_canon_sha256":"b2cb7262bcb4ad61bffc9731c4a5bf71072cfcf94ef0093ccf99dda4263b7631"},"schema_version":"1.0","source":{"id":"1606.05119","kind":"arxiv","version":1}},"canonical_sha256":"e2dea949cb3314ca747b76bf6e77b7b6df37ff203dca3fe74aba4f2e4401a935","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e2dea949cb3314ca747b76bf6e77b7b6df37ff203dca3fe74aba4f2e4401a935","first_computed_at":"2026-05-18T01:12:21.980607Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:12:21.980607Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"1G8YrtQUVcZtEVhOwBYAkqUnOIfkQWD/u1hfyrUwONe42TxaOs8ROS/H2FJqryH3Ra5SofFiuODAKix9noZMDA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:12:21.980924Z","signed_message":"canonical_sha256_bytes"},"source_id":"1606.05119","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f3dfaaad2cfaa20f3b68adecc54e507a4d9c12b5c2160b534c30c51b3833b1c4","sha256:75f1820aee273883dd785f58a69fb78ea9394a08689905a8cb8db86956d6ebe4"],"state_sha256":"c0489c3c83a41f8269677cc968c53aa54f9e45ee48be3f5edd9f2cff731aa4a8"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZiuLH8Rqfg4znpzt4ByxIC4JUfcqveH6gw0p2HTppncEWPwKAfz9HJi8DqWxAAqWLqNkpnXe6W6uyzhKnb0qDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T17:23:55.366665Z","bundle_sha256":"f0e35e5d34faf5004f9232b48cee96c50824485785ec3a9edddb9c75a90710fc"}}