{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:GXJA6RFISFV4P2ABLB2GF2EJXL","short_pith_number":"pith:GXJA6RFI","schema_version":"1.0","canonical_sha256":"35d20f44a8916bc7e801587462e889bafb56d853985c3d003b8310d5eb8e813f","source":{"kind":"arxiv","id":"2005.11161","version":3},"attestation_state":"computed","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2005.11161","created_at":"2026-07-05T01:09:06.775575+00:00"},{"alias_kind":"arxiv_version","alias_value":"2005.11161v3","created_at":"2026-07-05T01:09:06.775575+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2005.11161","created_at":"2026-07-05T01:09:06.775575+00:00"},{"alias_kind":"pith_short_12","alias_value":"GXJA6RFISFV4","created_at":"2026-07-05T01:09:06.775575+00:00"},{"alias_kind":"pith_short_16","alias_value":"GXJA6RFISFV4P2AB","created_at":"2026-07-05T01:09:06.775575+00:00"},{"alias_kind":"pith_short_8","alias_value":"GXJA6RFI","created_at":"2026-07-05T01:09:06.775575+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/GXJA6RFISFV4P2ABLB2GF2EJXL","json":"https://pith.science/pith/GXJA6RFISFV4P2ABLB2GF2EJXL.json","graph_json":"https://pith.science/api/pith-number/GXJA6RFISFV4P2ABLB2GF2EJXL/graph.json","events_json":"https://pith.science/api/pith-number/GXJA6RFISFV4P2ABLB2GF2EJXL/events.json","paper":"https://pith.science/paper/GXJA6RFI"},"agent_actions":{"view_html":"https://pith.science/pith/GXJA6RFISFV4P2ABLB2GF2EJXL","download_json":"https://pith.science/pith/GXJA6RFISFV4P2ABLB2GF2EJXL.json","view_paper":"https://pith.science/paper/GXJA6RFI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2005.11161&json=true","fetch_graph":"https://pith.science/api/pith-number/GXJA6RFISFV4P2ABLB2GF2EJXL/graph.json","fetch_events":"https://pith.science/api/pith-number/GXJA6RFISFV4P2ABLB2GF2EJXL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GXJA6RFISFV4P2ABLB2GF2EJXL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GXJA6RFISFV4P2ABLB2GF2EJXL/action/storage_attestation","attest_author":"https://pith.science/pith/GXJA6RFISFV4P2ABLB2GF2EJXL/action/author_attestation","sign_citation":"https://pith.science/pith/GXJA6RFISFV4P2ABLB2GF2EJXL/action/citation_signature","submit_replication":"https://pith.science/pith/GXJA6RFISFV4P2ABLB2GF2EJXL/action/replication_record"}},"created_at":"2026-07-05T01:09:06.775575+00:00","updated_at":"2026-07-05T01:09:06.775575+00:00"}