{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:DQAPGZ4W7JL7HUJS2RD6TRKDBI","short_pith_number":"pith:DQAPGZ4W","schema_version":"1.0","canonical_sha256":"1c00f36796fa57f3d132d447e9c5430a1104079a803ced4a064babe45cdfb714","source":{"kind":"arxiv","id":"2310.07912","version":2},"attestation_state":"computed","paper":{"title":"Irreducibility of Markov Chains on simplicial complexes, the Spectrum of the Discrete Hodge Laplacian and Homology","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":["math.AT","math.PR"],"primary_cat":"math.SP","authors_text":"Marzieh Eidi, Sayan Mukherjee","submitted_at":"2023-10-11T21:41:31Z","abstract_excerpt":"Random walks on graphs are a fundamental concept in graph theory and play a crucial role in solving a wide range of theoretical and applied problems in discrete math, probability, theoretical computer science, network science, and machine learning. The connection between Markov chains on graphs and their geometric and topological structures is the main reason why such a wide range of theoretical and practical applications exist. Graph connectedness ensures irreducibility of a Markov chain. The convergence rate to the stationary distribution is determined by the spectrum of the graph Laplacian "},"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":"2310.07912","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"math.SP","submitted_at":"2023-10-11T21:41:31Z","cross_cats_sorted":["math.AT","math.PR"],"title_canon_sha256":"f558fcf293ed38900dd4361ba1023b8444a03968a2cdcf64d0b9b2b7974188b0","abstract_canon_sha256":"78b1e443aa08e1d3c85628f5844f73c03f7f48f0e7c059c14b224865cb9d0002"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:14:18.673143Z","signature_b64":"1m2Z3yMnbjtSAlo/Jpc+aNU9CjpQ1ba5bM8aUi42eCcsF+XHPnR0PHmn0uo7V+rbzrKGm+RcoekPX7B7GR4DBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1c00f36796fa57f3d132d447e9c5430a1104079a803ced4a064babe45cdfb714","last_reissued_at":"2026-07-05T07:14:18.672721Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:14:18.672721Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Irreducibility of Markov Chains on simplicial complexes, the Spectrum of the Discrete Hodge Laplacian and Homology","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":["math.AT","math.PR"],"primary_cat":"math.SP","authors_text":"Marzieh Eidi, Sayan Mukherjee","submitted_at":"2023-10-11T21:41:31Z","abstract_excerpt":"Random walks on graphs are a fundamental concept in graph theory and play a crucial role in solving a wide range of theoretical and applied problems in discrete math, probability, theoretical computer science, network science, and machine learning. The connection between Markov chains on graphs and their geometric and topological structures is the main reason why such a wide range of theoretical and practical applications exist. Graph connectedness ensures irreducibility of a Markov chain. The convergence rate to the stationary distribution is determined by the spectrum of the graph Laplacian "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2310.07912","kind":"arxiv","version":2},"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/2310.07912/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":"2310.07912","created_at":"2026-07-05T07:14:18.672782+00:00"},{"alias_kind":"arxiv_version","alias_value":"2310.07912v2","created_at":"2026-07-05T07:14:18.672782+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2310.07912","created_at":"2026-07-05T07:14:18.672782+00:00"},{"alias_kind":"pith_short_12","alias_value":"DQAPGZ4W7JL7","created_at":"2026-07-05T07:14:18.672782+00:00"},{"alias_kind":"pith_short_16","alias_value":"DQAPGZ4W7JL7HUJS","created_at":"2026-07-05T07:14:18.672782+00:00"},{"alias_kind":"pith_short_8","alias_value":"DQAPGZ4W","created_at":"2026-07-05T07:14:18.672782+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2506.19857","citing_title":"Finding the Cores of Higher Graphs Using Geometric and Topological Means: A Survey","ref_index":48,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/DQAPGZ4W7JL7HUJS2RD6TRKDBI","json":"https://pith.science/pith/DQAPGZ4W7JL7HUJS2RD6TRKDBI.json","graph_json":"https://pith.science/api/pith-number/DQAPGZ4W7JL7HUJS2RD6TRKDBI/graph.json","events_json":"https://pith.science/api/pith-number/DQAPGZ4W7JL7HUJS2RD6TRKDBI/events.json","paper":"https://pith.science/paper/DQAPGZ4W"},"agent_actions":{"view_html":"https://pith.science/pith/DQAPGZ4W7JL7HUJS2RD6TRKDBI","download_json":"https://pith.science/pith/DQAPGZ4W7JL7HUJS2RD6TRKDBI.json","view_paper":"https://pith.science/paper/DQAPGZ4W","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2310.07912&json=true","fetch_graph":"https://pith.science/api/pith-number/DQAPGZ4W7JL7HUJS2RD6TRKDBI/graph.json","fetch_events":"https://pith.science/api/pith-number/DQAPGZ4W7JL7HUJS2RD6TRKDBI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DQAPGZ4W7JL7HUJS2RD6TRKDBI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DQAPGZ4W7JL7HUJS2RD6TRKDBI/action/storage_attestation","attest_author":"https://pith.science/pith/DQAPGZ4W7JL7HUJS2RD6TRKDBI/action/author_attestation","sign_citation":"https://pith.science/pith/DQAPGZ4W7JL7HUJS2RD6TRKDBI/action/citation_signature","submit_replication":"https://pith.science/pith/DQAPGZ4W7JL7HUJS2RD6TRKDBI/action/replication_record"}},"created_at":"2026-07-05T07:14:18.672782+00:00","updated_at":"2026-07-05T07:14:18.672782+00:00"}