{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2006:UCOVY2PS6O3UTB4RMG44T6ONF5","short_pith_number":"pith:UCOVY2PS","canonical_record":{"source":{"id":"math/0602073","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"math.CO","submitted_at":"2006-02-05T15:55:52Z","cross_cats_sorted":["cs.DS","cs.NI","math.MG"],"title_canon_sha256":"56076a476a0eb53f953194ebdb26c955239d3f6dea8b3de2bef56999df7326da","abstract_canon_sha256":"49e0d9098b55ebd944a3bc465a1de8351fd6b5273c4975494dd2e17e3080dd6a"},"schema_version":"1.0"},"canonical_sha256":"a09d5c69f2f3b749879161b9c9f9cd2f5bc2a4facb96a59dce30a87ec6503ee8","source":{"kind":"arxiv","id":"math/0602073","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"math/0602073","created_at":"2026-07-04T14:53:22Z"},{"alias_kind":"arxiv_version","alias_value":"math/0602073v1","created_at":"2026-07-04T14:53:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.math/0602073","created_at":"2026-07-04T14:53:22Z"},{"alias_kind":"pith_short_12","alias_value":"UCOVY2PS6O3U","created_at":"2026-07-04T14:53:22Z"},{"alias_kind":"pith_short_16","alias_value":"UCOVY2PS6O3UTB4R","created_at":"2026-07-04T14:53:22Z"},{"alias_kind":"pith_short_8","alias_value":"UCOVY2PS","created_at":"2026-07-04T14:53:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2006:UCOVY2PS6O3UTB4RMG44T6ONF5","target":"record","payload":{"canonical_record":{"source":{"id":"math/0602073","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"math.CO","submitted_at":"2006-02-05T15:55:52Z","cross_cats_sorted":["cs.DS","cs.NI","math.MG"],"title_canon_sha256":"56076a476a0eb53f953194ebdb26c955239d3f6dea8b3de2bef56999df7326da","abstract_canon_sha256":"49e0d9098b55ebd944a3bc465a1de8351fd6b5273c4975494dd2e17e3080dd6a"},"schema_version":"1.0"},"canonical_sha256":"a09d5c69f2f3b749879161b9c9f9cd2f5bc2a4facb96a59dce30a87ec6503ee8","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T14:53:22.799671Z","signature_b64":"WTAJRRx1ojlM0IYB+kVpRFofsxfv5BZAwPMo71iHYo9jjwn6rq+p+LuK7kyDtxHtYHYAlSHZTEXNdJYVRo19BQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a09d5c69f2f3b749879161b9c9f9cd2f5bc2a4facb96a59dce30a87ec6503ee8","last_reissued_at":"2026-07-04T14:53:22.799256Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T14:53:22.799256Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"math/0602073","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-07-04T14:53:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LAnfOLglz6tRKmqspU2benSBYGR3xcp6PPimOt6PEhhd6G6Rc43cmWIxqtJ6wUb9e/usAxCeHSMUacRmXUpyCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-08T19:13:58.756761Z"},"content_sha256":"7456e64c943466797eb8ec571acf85d1b3c8aa5dee7100720ad21f84f2a76514","schema_version":"1.0","event_id":"sha256:7456e64c943466797eb8ec571acf85d1b3c8aa5dee7100720ad21f84f2a76514"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2006:UCOVY2PS6O3UTB4RMG44T6ONF5","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On Proximity Measures for Graph Vertices","license":"","headline":"","cross_cats":["cs.DS","cs.NI","math.MG"],"primary_cat":"math.CO","authors_text":"Elena Shamis, Pavel Chebotarev","submitted_at":"2006-02-05T15:55:52Z","abstract_excerpt":"We study the properties of several proximity measures for the vertices of weighted multigraphs and multidigraphs. Unlike the classical distance for the vertices of connected graphs, these proximity measures are applicable to weighted structures and take into account not only the shortest, but also all other connections, which is desirable in many applications. To apply these proximity measures to unweighted structures, every edge should be assigned the same weight which determines the proportion of taking account of two routes, from which one is one edge longer than the other. Among the proxim"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"math/0602073","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/math/0602073/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-04T14:53:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sZleWTimcwAUZeh77Xf6Fr2HA3aU192B2o/CUtmt4rFffUb2nin56Dd191mNdPqkY0f3OuaK1TianIhKGZ44Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-08T19:13:58.757144Z"},"content_sha256":"ed3976401358ff880850cc42ea47687adabf0493bdce21a0fb4e97fd97545da5","schema_version":"1.0","event_id":"sha256:ed3976401358ff880850cc42ea47687adabf0493bdce21a0fb4e97fd97545da5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/UCOVY2PS6O3UTB4RMG44T6ONF5/bundle.json","state_url":"https://pith.science/pith/UCOVY2PS6O3UTB4RMG44T6ONF5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/UCOVY2PS6O3UTB4RMG44T6ONF5/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-07-08T19:13:58Z","links":{"resolver":"https://pith.science/pith/UCOVY2PS6O3UTB4RMG44T6ONF5","bundle":"https://pith.science/pith/UCOVY2PS6O3UTB4RMG44T6ONF5/bundle.json","state":"https://pith.science/pith/UCOVY2PS6O3UTB4RMG44T6ONF5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/UCOVY2PS6O3UTB4RMG44T6ONF5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2006:UCOVY2PS6O3UTB4RMG44T6ONF5","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":"49e0d9098b55ebd944a3bc465a1de8351fd6b5273c4975494dd2e17e3080dd6a","cross_cats_sorted":["cs.DS","cs.NI","math.MG"],"license":"","primary_cat":"math.CO","submitted_at":"2006-02-05T15:55:52Z","title_canon_sha256":"56076a476a0eb53f953194ebdb26c955239d3f6dea8b3de2bef56999df7326da"},"schema_version":"1.0","source":{"id":"math/0602073","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"math/0602073","created_at":"2026-07-04T14:53:22Z"},{"alias_kind":"arxiv_version","alias_value":"math/0602073v1","created_at":"2026-07-04T14:53:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.math/0602073","created_at":"2026-07-04T14:53:22Z"},{"alias_kind":"pith_short_12","alias_value":"UCOVY2PS6O3U","created_at":"2026-07-04T14:53:22Z"},{"alias_kind":"pith_short_16","alias_value":"UCOVY2PS6O3UTB4R","created_at":"2026-07-04T14:53:22Z"},{"alias_kind":"pith_short_8","alias_value":"UCOVY2PS","created_at":"2026-07-04T14:53:22Z"}],"graph_snapshots":[{"event_id":"sha256:ed3976401358ff880850cc42ea47687adabf0493bdce21a0fb4e97fd97545da5","target":"graph","created_at":"2026-07-04T14:53:22Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/math/0602073/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We study the properties of several proximity measures for the vertices of weighted multigraphs and multidigraphs. Unlike the classical distance for the vertices of connected graphs, these proximity measures are applicable to weighted structures and take into account not only the shortest, but also all other connections, which is desirable in many applications. To apply these proximity measures to unweighted structures, every edge should be assigned the same weight which determines the proportion of taking account of two routes, from which one is one edge longer than the other. Among the proxim","authors_text":"Elena Shamis, Pavel Chebotarev","cross_cats":["cs.DS","cs.NI","math.MG"],"headline":"","license":"","primary_cat":"math.CO","submitted_at":"2006-02-05T15:55:52Z","title":"On Proximity Measures for Graph Vertices"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"math/0602073","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:7456e64c943466797eb8ec571acf85d1b3c8aa5dee7100720ad21f84f2a76514","target":"record","created_at":"2026-07-04T14:53:22Z","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":"49e0d9098b55ebd944a3bc465a1de8351fd6b5273c4975494dd2e17e3080dd6a","cross_cats_sorted":["cs.DS","cs.NI","math.MG"],"license":"","primary_cat":"math.CO","submitted_at":"2006-02-05T15:55:52Z","title_canon_sha256":"56076a476a0eb53f953194ebdb26c955239d3f6dea8b3de2bef56999df7326da"},"schema_version":"1.0","source":{"id":"math/0602073","kind":"arxiv","version":1}},"canonical_sha256":"a09d5c69f2f3b749879161b9c9f9cd2f5bc2a4facb96a59dce30a87ec6503ee8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a09d5c69f2f3b749879161b9c9f9cd2f5bc2a4facb96a59dce30a87ec6503ee8","first_computed_at":"2026-07-04T14:53:22.799256Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-04T14:53:22.799256Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"WTAJRRx1ojlM0IYB+kVpRFofsxfv5BZAwPMo71iHYo9jjwn6rq+p+LuK7kyDtxHtYHYAlSHZTEXNdJYVRo19BQ==","signature_status":"signed_v1","signed_at":"2026-07-04T14:53:22.799671Z","signed_message":"canonical_sha256_bytes"},"source_id":"math/0602073","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7456e64c943466797eb8ec571acf85d1b3c8aa5dee7100720ad21f84f2a76514","sha256:ed3976401358ff880850cc42ea47687adabf0493bdce21a0fb4e97fd97545da5"],"state_sha256":"76011ed0ced5d801de6bdd517f710229d9f9f757642f1faf1853fed09a64eadf"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZXHxfsPlP2EwlsE8VDvflGF1h/yjqv65kCAd60KPz4nXFoqzNjVwLdbHkct+HCe5LusgtJr6M8EgQJ4tHb1vBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-08T19:13:58.759169Z","bundle_sha256":"72885d5701e33ae057e8ae5d911c6c4bc4d92e265497f4f4dec97fc36a6bb0b3"}}