{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:ZCCHHPFCYJOUX6FC2C574FB2LN","short_pith_number":"pith:ZCCHHPFC","schema_version":"1.0","canonical_sha256":"c88473bca2c25d4bf8a2d0bbfe143a5b7519d1dbc008d75187280ad4d926a6c3","source":{"kind":"arxiv","id":"1601.07009","version":1},"attestation_state":"computed","paper":{"title":"Greedy reduction of navigation time in random search processes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["physics.soc-ph"],"primary_cat":"cs.SI","authors_text":"Igor Trpevski, Ljupco Kocarev","submitted_at":"2016-01-26T13:14:44Z","abstract_excerpt":"Random search processes are instrumental in studying and understanding navigation properties of complex networks, food search strategies of animals, diffusion control of molecular processes in biological cells, and improving web search engines. An essential part of random search processes and their applications are various forms of (continuous or discrete time) random walk models. The efficiency of a random search strategy in complex networks is measured with the mean first passage time between two nodes or, more generally, with the mean first passage time between two subsets of the vertex set"},"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":"1601.07009","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2016-01-26T13:14:44Z","cross_cats_sorted":["physics.soc-ph"],"title_canon_sha256":"c8e8912c9d979ad2a32a7d0bad7915a0b0ddcd29dd1f91cdb801ec2d4f64e9fe","abstract_canon_sha256":"db40aedefd0f6305f277da0ff2e43a4f6a35e12acf1add814872d08b312203ae"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:21:59.305909Z","signature_b64":"6qHPaEvSTjy7NgUah0xN3bGYvtN+bLQd4hxRhxIp2LPK8/HzUhOA2CZCZTtZt5VQMhxkNyD+Yfq0GHbK6NsDAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c88473bca2c25d4bf8a2d0bbfe143a5b7519d1dbc008d75187280ad4d926a6c3","last_reissued_at":"2026-05-18T01:21:59.305455Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:21:59.305455Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Greedy reduction of navigation time in random search processes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["physics.soc-ph"],"primary_cat":"cs.SI","authors_text":"Igor Trpevski, Ljupco Kocarev","submitted_at":"2016-01-26T13:14:44Z","abstract_excerpt":"Random search processes are instrumental in studying and understanding navigation properties of complex networks, food search strategies of animals, diffusion control of molecular processes in biological cells, and improving web search engines. An essential part of random search processes and their applications are various forms of (continuous or discrete time) random walk models. The efficiency of a random search strategy in complex networks is measured with the mean first passage time between two nodes or, more generally, with the mean first passage time between two subsets of the vertex set"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1601.07009","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1601.07009","created_at":"2026-05-18T01:21:59.305523+00:00"},{"alias_kind":"arxiv_version","alias_value":"1601.07009v1","created_at":"2026-05-18T01:21:59.305523+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1601.07009","created_at":"2026-05-18T01:21:59.305523+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZCCHHPFCYJOU","created_at":"2026-05-18T12:30:53.716459+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZCCHHPFCYJOUX6FC","created_at":"2026-05-18T12:30:53.716459+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZCCHHPFC","created_at":"2026-05-18T12:30:53.716459+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/ZCCHHPFCYJOUX6FC2C574FB2LN","json":"https://pith.science/pith/ZCCHHPFCYJOUX6FC2C574FB2LN.json","graph_json":"https://pith.science/api/pith-number/ZCCHHPFCYJOUX6FC2C574FB2LN/graph.json","events_json":"https://pith.science/api/pith-number/ZCCHHPFCYJOUX6FC2C574FB2LN/events.json","paper":"https://pith.science/paper/ZCCHHPFC"},"agent_actions":{"view_html":"https://pith.science/pith/ZCCHHPFCYJOUX6FC2C574FB2LN","download_json":"https://pith.science/pith/ZCCHHPFCYJOUX6FC2C574FB2LN.json","view_paper":"https://pith.science/paper/ZCCHHPFC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1601.07009&json=true","fetch_graph":"https://pith.science/api/pith-number/ZCCHHPFCYJOUX6FC2C574FB2LN/graph.json","fetch_events":"https://pith.science/api/pith-number/ZCCHHPFCYJOUX6FC2C574FB2LN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZCCHHPFCYJOUX6FC2C574FB2LN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZCCHHPFCYJOUX6FC2C574FB2LN/action/storage_attestation","attest_author":"https://pith.science/pith/ZCCHHPFCYJOUX6FC2C574FB2LN/action/author_attestation","sign_citation":"https://pith.science/pith/ZCCHHPFCYJOUX6FC2C574FB2LN/action/citation_signature","submit_replication":"https://pith.science/pith/ZCCHHPFCYJOUX6FC2C574FB2LN/action/replication_record"}},"created_at":"2026-05-18T01:21:59.305523+00:00","updated_at":"2026-05-18T01:21:59.305523+00:00"}