{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2009:VBKH5JQWB42DYRV3R4GLQLDZIT","short_pith_number":"pith:VBKH5JQW","schema_version":"1.0","canonical_sha256":"a8547ea6160f343c46bb8f0cb82c7944ca4ebc84e7fa82d3d43b03376da60d30","source":{"kind":"arxiv","id":"0904.0183","version":2},"attestation_state":"computed","paper":{"title":"Row-finite equivalents exist only for row-countable graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.RA","authors_text":"Gene Abrams, Kulumani M. Rangaswamy","submitted_at":"2009-04-01T15:30:05Z","abstract_excerpt":"If $E$ is a not-necessarily row-finite graph, such that each vertex of $E$ emits at most countably many edges, then a {\\it desingularization} $F$ of $E$ can be constructed (see e.g. (1) G. Abrams, G. Aranda Pino, Leavitt path algebras of arbitrary graphs, Houston J. Math 34(2) (2008), 423-442, or (2) I. Raeburn, \"Graph algebras\". CBMS Regional Conference Series in Mathematics 103, Conference Board of the Mathematical Sciences, Washington, DC, 2005, ISBN 0-8218-3660-9). The desingularization process has been effectively used to establish various characteristics of the Leavitt path algebras of n"},"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":"0904.0183","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.RA","submitted_at":"2009-04-01T15:30:05Z","cross_cats_sorted":[],"title_canon_sha256":"deacc7bf3d1e769c93e694922710c7ccc0587931b4205ae310b6211b565a3e61","abstract_canon_sha256":"6ef5b7c43c6d8bdfeaaa8440ba8bd9da7c374f033315550a5481aa89e1ae542a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:32:09.681921Z","signature_b64":"BedlDKoj2Wdh4CqyBX+m/c2M2iH5V1ZHRT/Ci9mXmUdv0nACTV5i608dbzOOwFaM39EWnonj/4BPx20xbZHCDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a8547ea6160f343c46bb8f0cb82c7944ca4ebc84e7fa82d3d43b03376da60d30","last_reissued_at":"2026-05-18T04:32:09.681453Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:32:09.681453Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Row-finite equivalents exist only for row-countable graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.RA","authors_text":"Gene Abrams, Kulumani M. Rangaswamy","submitted_at":"2009-04-01T15:30:05Z","abstract_excerpt":"If $E$ is a not-necessarily row-finite graph, such that each vertex of $E$ emits at most countably many edges, then a {\\it desingularization} $F$ of $E$ can be constructed (see e.g. (1) G. Abrams, G. Aranda Pino, Leavitt path algebras of arbitrary graphs, Houston J. Math 34(2) (2008), 423-442, or (2) I. Raeburn, \"Graph algebras\". CBMS Regional Conference Series in Mathematics 103, Conference Board of the Mathematical Sciences, Washington, DC, 2005, ISBN 0-8218-3660-9). The desingularization process has been effectively used to establish various characteristics of the Leavitt path algebras of n"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0904.0183","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":""},"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":"0904.0183","created_at":"2026-05-18T04:32:09.681520+00:00"},{"alias_kind":"arxiv_version","alias_value":"0904.0183v2","created_at":"2026-05-18T04:32:09.681520+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0904.0183","created_at":"2026-05-18T04:32:09.681520+00:00"},{"alias_kind":"pith_short_12","alias_value":"VBKH5JQWB42D","created_at":"2026-05-18T12:26:02.257875+00:00"},{"alias_kind":"pith_short_16","alias_value":"VBKH5JQWB42DYRV3","created_at":"2026-05-18T12:26:02.257875+00:00"},{"alias_kind":"pith_short_8","alias_value":"VBKH5JQW","created_at":"2026-05-18T12:26:02.257875+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/VBKH5JQWB42DYRV3R4GLQLDZIT","json":"https://pith.science/pith/VBKH5JQWB42DYRV3R4GLQLDZIT.json","graph_json":"https://pith.science/api/pith-number/VBKH5JQWB42DYRV3R4GLQLDZIT/graph.json","events_json":"https://pith.science/api/pith-number/VBKH5JQWB42DYRV3R4GLQLDZIT/events.json","paper":"https://pith.science/paper/VBKH5JQW"},"agent_actions":{"view_html":"https://pith.science/pith/VBKH5JQWB42DYRV3R4GLQLDZIT","download_json":"https://pith.science/pith/VBKH5JQWB42DYRV3R4GLQLDZIT.json","view_paper":"https://pith.science/paper/VBKH5JQW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=0904.0183&json=true","fetch_graph":"https://pith.science/api/pith-number/VBKH5JQWB42DYRV3R4GLQLDZIT/graph.json","fetch_events":"https://pith.science/api/pith-number/VBKH5JQWB42DYRV3R4GLQLDZIT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VBKH5JQWB42DYRV3R4GLQLDZIT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VBKH5JQWB42DYRV3R4GLQLDZIT/action/storage_attestation","attest_author":"https://pith.science/pith/VBKH5JQWB42DYRV3R4GLQLDZIT/action/author_attestation","sign_citation":"https://pith.science/pith/VBKH5JQWB42DYRV3R4GLQLDZIT/action/citation_signature","submit_replication":"https://pith.science/pith/VBKH5JQWB42DYRV3R4GLQLDZIT/action/replication_record"}},"created_at":"2026-05-18T04:32:09.681520+00:00","updated_at":"2026-05-18T04:32:09.681520+00:00"}