{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:HXHDFC3ULVCG3PDJ6NO6HOBGJN","short_pith_number":"pith:HXHDFC3U","schema_version":"1.0","canonical_sha256":"3dce328b745d446dbc69f35de3b8264b601fc9caad375da6a09cb14f185b7e4c","source":{"kind":"arxiv","id":"2206.04725","version":1},"attestation_state":"computed","paper":{"title":"Persistent Homology with k-nearest-neighbor Filtrations reveals Topological Convergence of PageRank","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.AT","authors_text":"Dane Taylor, Minh Quang Le","submitted_at":"2022-06-09T18:46:21Z","abstract_excerpt":"Graph-based representations of point-cloud data are widely used in data science and machine learning, including epsilon-graphs that contain edges between pairs of data points that are nearer than epsilon and kNN-graphs that connect each point to its k-nearest neighbors. Recently, topological data analysis has emerged as a family of mathematical and computational techniques to investigate topological features of data using simplicial complexes. These are a higher-order generalization of graphs and many techniques such as Vietoris-Rips (VR) filtrations are also parameterized by a distance epsilo"},"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":"2206.04725","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.AT","submitted_at":"2022-06-09T18:46:21Z","cross_cats_sorted":[],"title_canon_sha256":"84d08627db48fb9ec143a176e8ae0ce95515c40ed977bde79bce3785df8333e8","abstract_canon_sha256":"ed5c123a0e5636363f00b806d2d0576b496aeb2b4969600681c3c99db5a4a4fc"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:30:43.474044Z","signature_b64":"aF1PC7z3OcLoErBAzFh6aEmUO41PYiPNyCcZsOKiSefx0WY+83WnnzIchRAvOfLjidoRJIvV2spPo2LfA6gIBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3dce328b745d446dbc69f35de3b8264b601fc9caad375da6a09cb14f185b7e4c","last_reissued_at":"2026-07-05T04:30:43.473647Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:30:43.473647Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Persistent Homology with k-nearest-neighbor Filtrations reveals Topological Convergence of PageRank","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.AT","authors_text":"Dane Taylor, Minh Quang Le","submitted_at":"2022-06-09T18:46:21Z","abstract_excerpt":"Graph-based representations of point-cloud data are widely used in data science and machine learning, including epsilon-graphs that contain edges between pairs of data points that are nearer than epsilon and kNN-graphs that connect each point to its k-nearest neighbors. Recently, topological data analysis has emerged as a family of mathematical and computational techniques to investigate topological features of data using simplicial complexes. These are a higher-order generalization of graphs and many techniques such as Vietoris-Rips (VR) filtrations are also parameterized by a distance epsilo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2206.04725","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/2206.04725/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":"2206.04725","created_at":"2026-07-05T04:30:43.473701+00:00"},{"alias_kind":"arxiv_version","alias_value":"2206.04725v1","created_at":"2026-07-05T04:30:43.473701+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2206.04725","created_at":"2026-07-05T04:30:43.473701+00:00"},{"alias_kind":"pith_short_12","alias_value":"HXHDFC3ULVCG","created_at":"2026-07-05T04:30:43.473701+00:00"},{"alias_kind":"pith_short_16","alias_value":"HXHDFC3ULVCG3PDJ","created_at":"2026-07-05T04:30:43.473701+00:00"},{"alias_kind":"pith_short_8","alias_value":"HXHDFC3U","created_at":"2026-07-05T04:30:43.473701+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/HXHDFC3ULVCG3PDJ6NO6HOBGJN","json":"https://pith.science/pith/HXHDFC3ULVCG3PDJ6NO6HOBGJN.json","graph_json":"https://pith.science/api/pith-number/HXHDFC3ULVCG3PDJ6NO6HOBGJN/graph.json","events_json":"https://pith.science/api/pith-number/HXHDFC3ULVCG3PDJ6NO6HOBGJN/events.json","paper":"https://pith.science/paper/HXHDFC3U"},"agent_actions":{"view_html":"https://pith.science/pith/HXHDFC3ULVCG3PDJ6NO6HOBGJN","download_json":"https://pith.science/pith/HXHDFC3ULVCG3PDJ6NO6HOBGJN.json","view_paper":"https://pith.science/paper/HXHDFC3U","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2206.04725&json=true","fetch_graph":"https://pith.science/api/pith-number/HXHDFC3ULVCG3PDJ6NO6HOBGJN/graph.json","fetch_events":"https://pith.science/api/pith-number/HXHDFC3ULVCG3PDJ6NO6HOBGJN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HXHDFC3ULVCG3PDJ6NO6HOBGJN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HXHDFC3ULVCG3PDJ6NO6HOBGJN/action/storage_attestation","attest_author":"https://pith.science/pith/HXHDFC3ULVCG3PDJ6NO6HOBGJN/action/author_attestation","sign_citation":"https://pith.science/pith/HXHDFC3ULVCG3PDJ6NO6HOBGJN/action/citation_signature","submit_replication":"https://pith.science/pith/HXHDFC3ULVCG3PDJ6NO6HOBGJN/action/replication_record"}},"created_at":"2026-07-05T04:30:43.473701+00:00","updated_at":"2026-07-05T04:30:43.473701+00:00"}