{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:MSJXK6HNG5ZRTDPWSZ7CUJPTZS","short_pith_number":"pith:MSJXK6HN","canonical_record":{"source":{"id":"1306.3030","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-06-13T06:16:41Z","cross_cats_sorted":[],"title_canon_sha256":"e357e5292e061b8eef4ee54f1be1b57551304f8032fedf4bd88a0b10f111135e","abstract_canon_sha256":"e49dc5655d95f5f303ef948780bb81839f455a2873981f86477c776098213045"},"schema_version":"1.0"},"canonical_sha256":"64937578ed3773198df6967e2a25f3cc84c7565d57a9e611d5f6c542e67d27a7","source":{"kind":"arxiv","id":"1306.3030","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1306.3030","created_at":"2026-05-18T02:51:15Z"},{"alias_kind":"arxiv_version","alias_value":"1306.3030v3","created_at":"2026-05-18T02:51:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1306.3030","created_at":"2026-05-18T02:51:15Z"},{"alias_kind":"pith_short_12","alias_value":"MSJXK6HNG5ZR","created_at":"2026-05-18T12:27:52Z"},{"alias_kind":"pith_short_16","alias_value":"MSJXK6HNG5ZRTDPW","created_at":"2026-05-18T12:27:52Z"},{"alias_kind":"pith_short_8","alias_value":"MSJXK6HN","created_at":"2026-05-18T12:27:52Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:MSJXK6HNG5ZRTDPWSZ7CUJPTZS","target":"record","payload":{"canonical_record":{"source":{"id":"1306.3030","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-06-13T06:16:41Z","cross_cats_sorted":[],"title_canon_sha256":"e357e5292e061b8eef4ee54f1be1b57551304f8032fedf4bd88a0b10f111135e","abstract_canon_sha256":"e49dc5655d95f5f303ef948780bb81839f455a2873981f86477c776098213045"},"schema_version":"1.0"},"canonical_sha256":"64937578ed3773198df6967e2a25f3cc84c7565d57a9e611d5f6c542e67d27a7","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:51:15.107586Z","signature_b64":"FAgU96iJ2JS1L430lvIrIbQErZ5/Tibrn20/0/3HGouN2TiHZvvF5/8AmwYdNyegw2+FpxwwPhyp5VbMss8rCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"64937578ed3773198df6967e2a25f3cc84c7565d57a9e611d5f6c542e67d27a7","last_reissued_at":"2026-05-18T02:51:15.107059Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:51:15.107059Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1306.3030","source_version":3,"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:51:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"r7ZkmMNSIp3cWdiGlxMjBe5WRFNc31ELK3zdT6qi92YswhDmyQdlzhTul8hy70yPUzcHuLG4t1ZeMklMearyDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T19:03:40.441151Z"},"content_sha256":"853b609191bb83b6337b64adf626d689813f4473577535da00ce5030c77db726","schema_version":"1.0","event_id":"sha256:853b609191bb83b6337b64adf626d689813f4473577535da00ce5030c77db726"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:MSJXK6HNG5ZRTDPWSZ7CUJPTZS","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Random Shortest Paths: Non-Euclidean Instances for Metric Optimization Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Bodo Manthey, B.V. Raghavendra Rao, Christian Engels, Karl Bringmann","submitted_at":"2013-06-13T06:16:41Z","abstract_excerpt":"Probabilistic analysis for metric optimization problems has mostly been conducted on random Euclidean instances, but little is known about metric instances drawn from distributions other than the Euclidean. This motivates our study of random metric instances for optimization problems obtained as follows: Every edge of a complete graph gets a weight drawn independently at random. The distance between two nodes is then the length of a shortest path (with respect to the weights drawn) that connects these nodes.\n  We prove structural properties of the random shortest path metrics generated in this"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1306.3030","kind":"arxiv","version":3},"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:51:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JJJIrdoCwerv+2HZAFuKt3FFHjzz809hNgNlExNIn59j+VO9RrAo12oBr0uAXEITA43M5w59Z/S3Ke7qGf6sCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T19:03:40.441510Z"},"content_sha256":"153bf652c9b91617f65a468de8740a9a7ac6e19dcaf9f07c3a3525d335a64eca","schema_version":"1.0","event_id":"sha256:153bf652c9b91617f65a468de8740a9a7ac6e19dcaf9f07c3a3525d335a64eca"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MSJXK6HNG5ZRTDPWSZ7CUJPTZS/bundle.json","state_url":"https://pith.science/pith/MSJXK6HNG5ZRTDPWSZ7CUJPTZS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MSJXK6HNG5ZRTDPWSZ7CUJPTZS/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-10T19:03:40Z","links":{"resolver":"https://pith.science/pith/MSJXK6HNG5ZRTDPWSZ7CUJPTZS","bundle":"https://pith.science/pith/MSJXK6HNG5ZRTDPWSZ7CUJPTZS/bundle.json","state":"https://pith.science/pith/MSJXK6HNG5ZRTDPWSZ7CUJPTZS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MSJXK6HNG5ZRTDPWSZ7CUJPTZS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:MSJXK6HNG5ZRTDPWSZ7CUJPTZS","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":"e49dc5655d95f5f303ef948780bb81839f455a2873981f86477c776098213045","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-06-13T06:16:41Z","title_canon_sha256":"e357e5292e061b8eef4ee54f1be1b57551304f8032fedf4bd88a0b10f111135e"},"schema_version":"1.0","source":{"id":"1306.3030","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1306.3030","created_at":"2026-05-18T02:51:15Z"},{"alias_kind":"arxiv_version","alias_value":"1306.3030v3","created_at":"2026-05-18T02:51:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1306.3030","created_at":"2026-05-18T02:51:15Z"},{"alias_kind":"pith_short_12","alias_value":"MSJXK6HNG5ZR","created_at":"2026-05-18T12:27:52Z"},{"alias_kind":"pith_short_16","alias_value":"MSJXK6HNG5ZRTDPW","created_at":"2026-05-18T12:27:52Z"},{"alias_kind":"pith_short_8","alias_value":"MSJXK6HN","created_at":"2026-05-18T12:27:52Z"}],"graph_snapshots":[{"event_id":"sha256:153bf652c9b91617f65a468de8740a9a7ac6e19dcaf9f07c3a3525d335a64eca","target":"graph","created_at":"2026-05-18T02:51: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":"Probabilistic analysis for metric optimization problems has mostly been conducted on random Euclidean instances, but little is known about metric instances drawn from distributions other than the Euclidean. This motivates our study of random metric instances for optimization problems obtained as follows: Every edge of a complete graph gets a weight drawn independently at random. The distance between two nodes is then the length of a shortest path (with respect to the weights drawn) that connects these nodes.\n  We prove structural properties of the random shortest path metrics generated in this","authors_text":"Bodo Manthey, B.V. Raghavendra Rao, Christian Engels, Karl Bringmann","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-06-13T06:16:41Z","title":"Random Shortest Paths: Non-Euclidean Instances for Metric Optimization Problems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1306.3030","kind":"arxiv","version":3},"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:853b609191bb83b6337b64adf626d689813f4473577535da00ce5030c77db726","target":"record","created_at":"2026-05-18T02:51: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":"e49dc5655d95f5f303ef948780bb81839f455a2873981f86477c776098213045","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-06-13T06:16:41Z","title_canon_sha256":"e357e5292e061b8eef4ee54f1be1b57551304f8032fedf4bd88a0b10f111135e"},"schema_version":"1.0","source":{"id":"1306.3030","kind":"arxiv","version":3}},"canonical_sha256":"64937578ed3773198df6967e2a25f3cc84c7565d57a9e611d5f6c542e67d27a7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"64937578ed3773198df6967e2a25f3cc84c7565d57a9e611d5f6c542e67d27a7","first_computed_at":"2026-05-18T02:51:15.107059Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:51:15.107059Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"FAgU96iJ2JS1L430lvIrIbQErZ5/Tibrn20/0/3HGouN2TiHZvvF5/8AmwYdNyegw2+FpxwwPhyp5VbMss8rCw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:51:15.107586Z","signed_message":"canonical_sha256_bytes"},"source_id":"1306.3030","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:853b609191bb83b6337b64adf626d689813f4473577535da00ce5030c77db726","sha256:153bf652c9b91617f65a468de8740a9a7ac6e19dcaf9f07c3a3525d335a64eca"],"state_sha256":"42b31c65be7b33082dfad2b699bcd14476d24e6bbe30b27811ff001aab92ca21"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"08lhiPpcrRs519i3uZJvvrJXHmEK3LD15GEGBzPPLUqK1CzfyFoCdQVXuzgVGrDwBV8t6Ih1IDW65xoLIWhSCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-10T19:03:40.443701Z","bundle_sha256":"5155bb62da6d8a3579ff79a85fd0ad6b3b400dbd03a52102672ae9c920fe8aba"}}