{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2020:GXJA6RFISFV4P2ABLB2GF2EJXL","short_pith_number":"pith:GXJA6RFI","canonical_record":{"source":{"id":"2005.11161","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2020-05-22T13:04:15Z","cross_cats_sorted":["stat.AP"],"title_canon_sha256":"eb3068b4c8c810a3ea8b77e2d0499943bf48bac294752fc829d3fa4b004a4bb4","abstract_canon_sha256":"81637b2bddebb078cb2308a88721d9c65b8afef14e62efca9c9979b0c5f6de67"},"schema_version":"1.0"},"canonical_sha256":"35d20f44a8916bc7e801587462e889bafb56d853985c3d003b8310d5eb8e813f","source":{"kind":"arxiv","id":"2005.11161","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2005.11161","created_at":"2026-07-05T01:09:06Z"},{"alias_kind":"arxiv_version","alias_value":"2005.11161v3","created_at":"2026-07-05T01:09:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2005.11161","created_at":"2026-07-05T01:09:06Z"},{"alias_kind":"pith_short_12","alias_value":"GXJA6RFISFV4","created_at":"2026-07-05T01:09:06Z"},{"alias_kind":"pith_short_16","alias_value":"GXJA6RFISFV4P2AB","created_at":"2026-07-05T01:09:06Z"},{"alias_kind":"pith_short_8","alias_value":"GXJA6RFI","created_at":"2026-07-05T01:09:06Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2020:GXJA6RFISFV4P2ABLB2GF2EJXL","target":"record","payload":{"canonical_record":{"source":{"id":"2005.11161","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2020-05-22T13:04:15Z","cross_cats_sorted":["stat.AP"],"title_canon_sha256":"eb3068b4c8c810a3ea8b77e2d0499943bf48bac294752fc829d3fa4b004a4bb4","abstract_canon_sha256":"81637b2bddebb078cb2308a88721d9c65b8afef14e62efca9c9979b0c5f6de67"},"schema_version":"1.0"},"canonical_sha256":"35d20f44a8916bc7e801587462e889bafb56d853985c3d003b8310d5eb8e813f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:09:06.776034Z","signature_b64":"ZPLsmBTqlm/9zAZsyPYwnXrPCkCwVoZMTsrtljJ5BuZu79+Xvwm2l0NgsQ22SkxROE55IU/xtW4qmWRqkKBwDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"35d20f44a8916bc7e801587462e889bafb56d853985c3d003b8310d5eb8e813f","last_reissued_at":"2026-07-05T01:09:06.775513Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:09:06.775513Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2005.11161","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-07-05T01:09:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"w9NMCLCi16kBJt8Smt6M+BHhA9Nflzqq2TLqlmBzhR+efWl5uqlkLs1c5HI4PSSagE1Zcr6U5FsdnZ9DywhJDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-08T19:43:06.863178Z"},"content_sha256":"b0b39dc0247c4c243024604006d433e818de19d22907368b0e5e5a02c201bd5b","schema_version":"1.0","event_id":"sha256:b0b39dc0247c4c243024604006d433e818de19d22907368b0e5e5a02c201bd5b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2020:GXJA6RFISFV4P2ABLB2GF2EJXL","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Graph Degree Heterogeneity Facilitates Random Walker Meetings","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.AP"],"primary_cat":"cs.SI","authors_text":"Hiroyuki Ohsaki, Yusuke Sakumoto","submitted_at":"2020-05-22T13:04:15Z","abstract_excerpt":"Various graph algorithms have been developed with multiple random walks, the movement of several independent random walkers on a graph. Designing an efficient graph algorithm based on multiple random walks requires investigating multiple random walks theoretically to attain a deep understanding of their characteristics. The first meeting time is one of the important metrics for multiple random walks. The first meeting time on a graph is defined by the time it takes for multiple random walkers to meet at the same node in a graph. This time is closely related to the rendezvous problem, a fundame"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2005.11161","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2005.11161/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-05T01:09:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JLckOzZEP6gX60it8Q8Cg/qwkeeN37hS78G61c+TcSOv6KUARO9mkjo+iL0gTp2THfRYHaUmksKcK5B3uMgWBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-08T19:43:06.863561Z"},"content_sha256":"68ccd627392ec91e18f6a052f0ee84f88bc2e7b28c4b1c492878a51774d1c891","schema_version":"1.0","event_id":"sha256:68ccd627392ec91e18f6a052f0ee84f88bc2e7b28c4b1c492878a51774d1c891"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GXJA6RFISFV4P2ABLB2GF2EJXL/bundle.json","state_url":"https://pith.science/pith/GXJA6RFISFV4P2ABLB2GF2EJXL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GXJA6RFISFV4P2ABLB2GF2EJXL/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:43:06Z","links":{"resolver":"https://pith.science/pith/GXJA6RFISFV4P2ABLB2GF2EJXL","bundle":"https://pith.science/pith/GXJA6RFISFV4P2ABLB2GF2EJXL/bundle.json","state":"https://pith.science/pith/GXJA6RFISFV4P2ABLB2GF2EJXL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GXJA6RFISFV4P2ABLB2GF2EJXL/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:GXJA6RFISFV4P2ABLB2GF2EJXL","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":"81637b2bddebb078cb2308a88721d9c65b8afef14e62efca9c9979b0c5f6de67","cross_cats_sorted":["stat.AP"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2020-05-22T13:04:15Z","title_canon_sha256":"eb3068b4c8c810a3ea8b77e2d0499943bf48bac294752fc829d3fa4b004a4bb4"},"schema_version":"1.0","source":{"id":"2005.11161","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2005.11161","created_at":"2026-07-05T01:09:06Z"},{"alias_kind":"arxiv_version","alias_value":"2005.11161v3","created_at":"2026-07-05T01:09:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2005.11161","created_at":"2026-07-05T01:09:06Z"},{"alias_kind":"pith_short_12","alias_value":"GXJA6RFISFV4","created_at":"2026-07-05T01:09:06Z"},{"alias_kind":"pith_short_16","alias_value":"GXJA6RFISFV4P2AB","created_at":"2026-07-05T01:09:06Z"},{"alias_kind":"pith_short_8","alias_value":"GXJA6RFI","created_at":"2026-07-05T01:09:06Z"}],"graph_snapshots":[{"event_id":"sha256:68ccd627392ec91e18f6a052f0ee84f88bc2e7b28c4b1c492878a51774d1c891","target":"graph","created_at":"2026-07-05T01:09:06Z","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/2005.11161/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Various graph algorithms have been developed with multiple random walks, the movement of several independent random walkers on a graph. Designing an efficient graph algorithm based on multiple random walks requires investigating multiple random walks theoretically to attain a deep understanding of their characteristics. The first meeting time is one of the important metrics for multiple random walks. The first meeting time on a graph is defined by the time it takes for multiple random walkers to meet at the same node in a graph. This time is closely related to the rendezvous problem, a fundame","authors_text":"Hiroyuki Ohsaki, Yusuke Sakumoto","cross_cats":["stat.AP"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2020-05-22T13:04:15Z","title":"Graph Degree Heterogeneity Facilitates Random Walker Meetings"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2005.11161","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:b0b39dc0247c4c243024604006d433e818de19d22907368b0e5e5a02c201bd5b","target":"record","created_at":"2026-07-05T01:09:06Z","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":"81637b2bddebb078cb2308a88721d9c65b8afef14e62efca9c9979b0c5f6de67","cross_cats_sorted":["stat.AP"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2020-05-22T13:04:15Z","title_canon_sha256":"eb3068b4c8c810a3ea8b77e2d0499943bf48bac294752fc829d3fa4b004a4bb4"},"schema_version":"1.0","source":{"id":"2005.11161","kind":"arxiv","version":3}},"canonical_sha256":"35d20f44a8916bc7e801587462e889bafb56d853985c3d003b8310d5eb8e813f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"35d20f44a8916bc7e801587462e889bafb56d853985c3d003b8310d5eb8e813f","first_computed_at":"2026-07-05T01:09:06.775513Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T01:09:06.775513Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ZPLsmBTqlm/9zAZsyPYwnXrPCkCwVoZMTsrtljJ5BuZu79+Xvwm2l0NgsQ22SkxROE55IU/xtW4qmWRqkKBwDA==","signature_status":"signed_v1","signed_at":"2026-07-05T01:09:06.776034Z","signed_message":"canonical_sha256_bytes"},"source_id":"2005.11161","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b0b39dc0247c4c243024604006d433e818de19d22907368b0e5e5a02c201bd5b","sha256:68ccd627392ec91e18f6a052f0ee84f88bc2e7b28c4b1c492878a51774d1c891"],"state_sha256":"cda91f7a8d02adc014670641363f11c6c35a3863c679d7586e482c6ac2e18a90"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cFIZEB15syAW5V2Pjxog4DL1dcVN16gbQzw5JSsBpBwhmj8Rb+uCRWMPBzr8Syc7yQquBZruxg/RLauy+v9rBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-08T19:43:06.865582Z","bundle_sha256":"ca4c73455fefb04b47c8f6c6fc7437b32288a125cbdd48a18f027a77d73ad743"}}