{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:YKRM54E4PY5SEOVI55EZJ5Z5O2","short_pith_number":"pith:YKRM54E4","schema_version":"1.0","canonical_sha256":"c2a2cef09c7e3b223aa8ef4994f73d769f21b524d483845d69c22d82b4535cf7","source":{"kind":"arxiv","id":"2103.13940","version":3},"attestation_state":"computed","paper":{"title":"Reachability and Matching in Single Crossing Minor Free Graphs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Anish Mukherjee, Chetan Gupta, Raghunath Tewari, Rahul Jain, Samir Datta, Vimal Raj Sharma","submitted_at":"2021-03-25T16:01:13Z","abstract_excerpt":"We show that for each single crossing graph $H$, a polynomially bounded weight function for all $H$-minor free graphs $G$ can be constructed in Logspace such that it gives nonzero weights to all the cycles in $G$. This class of graphs subsumes almost all classes of graphs for which such a weight function is known to be constructed in Logspace. As a consequence, we obtain that for the class of $H$-minor free graphs where $H$ is a single crossing graph, reachability can be solved in UL, and bipartite maximum matching can be solved in SPL, which are small subclasses of the parallel complexity cla"},"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":"2103.13940","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CC","submitted_at":"2021-03-25T16:01:13Z","cross_cats_sorted":[],"title_canon_sha256":"f73abbda47e7cc854ac52568b9d6081145105bc9e703146fa61d1376b5ecea11","abstract_canon_sha256":"24821a455e9e73d9c526a484075f2330bc4b1a7505f93513e2f133ca04801eaf"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:11:28.693955Z","signature_b64":"03w17xjiGhuwdw2mvs/ceJD3XatUtFps2Zgm9j6U6do3eQrkI/+hEwdK67L2GaijkPsx2vAkxnXLOHG2xLJHCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c2a2cef09c7e3b223aa8ef4994f73d769f21b524d483845d69c22d82b4535cf7","last_reissued_at":"2026-07-05T03:11:28.693601Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:11:28.693601Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Reachability and Matching in Single Crossing Minor Free Graphs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Anish Mukherjee, Chetan Gupta, Raghunath Tewari, Rahul Jain, Samir Datta, Vimal Raj Sharma","submitted_at":"2021-03-25T16:01:13Z","abstract_excerpt":"We show that for each single crossing graph $H$, a polynomially bounded weight function for all $H$-minor free graphs $G$ can be constructed in Logspace such that it gives nonzero weights to all the cycles in $G$. This class of graphs subsumes almost all classes of graphs for which such a weight function is known to be constructed in Logspace. As a consequence, we obtain that for the class of $H$-minor free graphs where $H$ is a single crossing graph, reachability can be solved in UL, and bipartite maximum matching can be solved in SPL, which are small subclasses of the parallel complexity cla"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2103.13940","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/2103.13940/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":"2103.13940","created_at":"2026-07-05T03:11:28.693666+00:00"},{"alias_kind":"arxiv_version","alias_value":"2103.13940v3","created_at":"2026-07-05T03:11:28.693666+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2103.13940","created_at":"2026-07-05T03:11:28.693666+00:00"},{"alias_kind":"pith_short_12","alias_value":"YKRM54E4PY5S","created_at":"2026-07-05T03:11:28.693666+00:00"},{"alias_kind":"pith_short_16","alias_value":"YKRM54E4PY5SEOVI","created_at":"2026-07-05T03:11:28.693666+00:00"},{"alias_kind":"pith_short_8","alias_value":"YKRM54E4","created_at":"2026-07-05T03:11:28.693666+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/YKRM54E4PY5SEOVI55EZJ5Z5O2","json":"https://pith.science/pith/YKRM54E4PY5SEOVI55EZJ5Z5O2.json","graph_json":"https://pith.science/api/pith-number/YKRM54E4PY5SEOVI55EZJ5Z5O2/graph.json","events_json":"https://pith.science/api/pith-number/YKRM54E4PY5SEOVI55EZJ5Z5O2/events.json","paper":"https://pith.science/paper/YKRM54E4"},"agent_actions":{"view_html":"https://pith.science/pith/YKRM54E4PY5SEOVI55EZJ5Z5O2","download_json":"https://pith.science/pith/YKRM54E4PY5SEOVI55EZJ5Z5O2.json","view_paper":"https://pith.science/paper/YKRM54E4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2103.13940&json=true","fetch_graph":"https://pith.science/api/pith-number/YKRM54E4PY5SEOVI55EZJ5Z5O2/graph.json","fetch_events":"https://pith.science/api/pith-number/YKRM54E4PY5SEOVI55EZJ5Z5O2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YKRM54E4PY5SEOVI55EZJ5Z5O2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YKRM54E4PY5SEOVI55EZJ5Z5O2/action/storage_attestation","attest_author":"https://pith.science/pith/YKRM54E4PY5SEOVI55EZJ5Z5O2/action/author_attestation","sign_citation":"https://pith.science/pith/YKRM54E4PY5SEOVI55EZJ5Z5O2/action/citation_signature","submit_replication":"https://pith.science/pith/YKRM54E4PY5SEOVI55EZJ5Z5O2/action/replication_record"}},"created_at":"2026-07-05T03:11:28.693666+00:00","updated_at":"2026-07-05T03:11:28.693666+00:00"}