{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:3T75TDL6UIUNJPXDTMIS3ZOABC","short_pith_number":"pith:3T75TDL6","schema_version":"1.0","canonical_sha256":"dcffd98d7ea228d4bee39b112de5c008924f68a47f51deea429fc2ee8535095c","source":{"kind":"arxiv","id":"2606.21103","version":1},"attestation_state":"computed","paper":{"title":"On the Reachability Problem on Monoid-Labelled Undirected Graphs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Harshil Mittal, Jayalal Sarma, Nagashri Krishnakumar","submitted_at":"2026-06-19T05:08:43Z","abstract_excerpt":"The labelled reachability problem for undirected graphs with edges labelled by elements of a monoid $M$ (more generally, groupoids or magmas) captures the classes $\\sf{L}$ and $\\sf{NL}$. Given a graph $G(V, E)$ labelled by $\\phi~\\colon E \\to M$, $s,t \\in V$ and an accepting subset $F \\subseteq M$, the problem asks to test whether there is a walk $P$ from $s$ to $t$ in $G$ where $\\phi(P) \\in F$. Ramaswamy et al. (2019) studied the variant where the accepting element is part of the input for aperiodic monoids and groups. Motivated by the success in designing space-bounded algorithms for the undi"},"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":"2606.21103","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CC","submitted_at":"2026-06-19T05:08:43Z","cross_cats_sorted":[],"title_canon_sha256":"df4ecd4853146e9b827487b6d355c2aa22090d7086a2b21a7c73af2a1799afeb","abstract_canon_sha256":"51c08c1dc78a7ac220d9e79c87a92d41ecf670d74fa18846e5b19b538cf22aab"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-23T01:12:30.056203Z","signature_b64":"hqqXZ0ieZPfOewIwIT2QOfc858t2dooA0SosLRkAMoZZIqAsl0q2086wfOBV5jK/JEgcNJGPK2Q52rhusREAAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"dcffd98d7ea228d4bee39b112de5c008924f68a47f51deea429fc2ee8535095c","last_reissued_at":"2026-06-23T01:12:30.055708Z","signature_status":"signed_v1","first_computed_at":"2026-06-23T01:12:30.055708Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the Reachability Problem on Monoid-Labelled Undirected Graphs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Harshil Mittal, Jayalal Sarma, Nagashri Krishnakumar","submitted_at":"2026-06-19T05:08:43Z","abstract_excerpt":"The labelled reachability problem for undirected graphs with edges labelled by elements of a monoid $M$ (more generally, groupoids or magmas) captures the classes $\\sf{L}$ and $\\sf{NL}$. Given a graph $G(V, E)$ labelled by $\\phi~\\colon E \\to M$, $s,t \\in V$ and an accepting subset $F \\subseteq M$, the problem asks to test whether there is a walk $P$ from $s$ to $t$ in $G$ where $\\phi(P) \\in F$. Ramaswamy et al. (2019) studied the variant where the accepting element is part of the input for aperiodic monoids and groups. Motivated by the success in designing space-bounded algorithms for the undi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.21103","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/2606.21103/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":"2606.21103","created_at":"2026-06-23T01:12:30.055793+00:00"},{"alias_kind":"arxiv_version","alias_value":"2606.21103v1","created_at":"2026-06-23T01:12:30.055793+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.21103","created_at":"2026-06-23T01:12:30.055793+00:00"},{"alias_kind":"pith_short_12","alias_value":"3T75TDL6UIUN","created_at":"2026-06-23T01:12:30.055793+00:00"},{"alias_kind":"pith_short_16","alias_value":"3T75TDL6UIUNJPXD","created_at":"2026-06-23T01:12:30.055793+00:00"},{"alias_kind":"pith_short_8","alias_value":"3T75TDL6","created_at":"2026-06-23T01:12:30.055793+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/3T75TDL6UIUNJPXDTMIS3ZOABC","json":"https://pith.science/pith/3T75TDL6UIUNJPXDTMIS3ZOABC.json","graph_json":"https://pith.science/api/pith-number/3T75TDL6UIUNJPXDTMIS3ZOABC/graph.json","events_json":"https://pith.science/api/pith-number/3T75TDL6UIUNJPXDTMIS3ZOABC/events.json","paper":"https://pith.science/paper/3T75TDL6"},"agent_actions":{"view_html":"https://pith.science/pith/3T75TDL6UIUNJPXDTMIS3ZOABC","download_json":"https://pith.science/pith/3T75TDL6UIUNJPXDTMIS3ZOABC.json","view_paper":"https://pith.science/paper/3T75TDL6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2606.21103&json=true","fetch_graph":"https://pith.science/api/pith-number/3T75TDL6UIUNJPXDTMIS3ZOABC/graph.json","fetch_events":"https://pith.science/api/pith-number/3T75TDL6UIUNJPXDTMIS3ZOABC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3T75TDL6UIUNJPXDTMIS3ZOABC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3T75TDL6UIUNJPXDTMIS3ZOABC/action/storage_attestation","attest_author":"https://pith.science/pith/3T75TDL6UIUNJPXDTMIS3ZOABC/action/author_attestation","sign_citation":"https://pith.science/pith/3T75TDL6UIUNJPXDTMIS3ZOABC/action/citation_signature","submit_replication":"https://pith.science/pith/3T75TDL6UIUNJPXDTMIS3ZOABC/action/replication_record"}},"created_at":"2026-06-23T01:12:30.055793+00:00","updated_at":"2026-06-23T01:12:30.055793+00:00"}