{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:REC36PZM4DMLI7LRIMHSFGS3WW","short_pith_number":"pith:REC36PZM","schema_version":"1.0","canonical_sha256":"8905bf3f2ce0d8b47d71430f229a5bb5a4e7e89076defc4cc3d7196b3da455dd","source":{"kind":"arxiv","id":"1606.04607","version":1},"attestation_state":"computed","paper":{"title":"A criterion for Leavitt path algebras having invariant basis number","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.RA","authors_text":"N. T. Phuc, T. G. Nam","submitted_at":"2016-06-15T01:21:59Z","abstract_excerpt":"In this paper, we give a matrix-theoretic criterion for the Leavitt path algebra of a finite graph has Invariant Basis Number. Consequently, we show that the Cohn path algebra of a finite graph has Invariant Basis Number, as well as provide some certain classes of finite graphs for which Leavitt path algebras having Invariant Basis Number."},"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":"1606.04607","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.RA","submitted_at":"2016-06-15T01:21:59Z","cross_cats_sorted":[],"title_canon_sha256":"f91f6bd78977eb565cb5bb9b57f181e5c1d8d1b1ffaab94dcafaf0afcfb754be","abstract_canon_sha256":"ec506f9ebccc316298b99f72778d3f882c5798a456902384694ee56bb3fea240"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:12:24.707660Z","signature_b64":"EOt3crIdeHH4nH0W4oo/lILbniyoTcgQULCJffCkGZ86VAA52FOa7VmkBnT7gYbPDvfCCgeLUz2WLfNR4eFkCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8905bf3f2ce0d8b47d71430f229a5bb5a4e7e89076defc4cc3d7196b3da455dd","last_reissued_at":"2026-05-18T01:12:24.707329Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:12:24.707329Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A criterion for Leavitt path algebras having invariant basis number","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.RA","authors_text":"N. T. Phuc, T. G. Nam","submitted_at":"2016-06-15T01:21:59Z","abstract_excerpt":"In this paper, we give a matrix-theoretic criterion for the Leavitt path algebra of a finite graph has Invariant Basis Number. Consequently, we show that the Cohn path algebra of a finite graph has Invariant Basis Number, as well as provide some certain classes of finite graphs for which Leavitt path algebras having Invariant Basis Number."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1606.04607","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":""},"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":"1606.04607","created_at":"2026-05-18T01:12:24.707382+00:00"},{"alias_kind":"arxiv_version","alias_value":"1606.04607v1","created_at":"2026-05-18T01:12:24.707382+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1606.04607","created_at":"2026-05-18T01:12:24.707382+00:00"},{"alias_kind":"pith_short_12","alias_value":"REC36PZM4DML","created_at":"2026-05-18T12:30:41.710351+00:00"},{"alias_kind":"pith_short_16","alias_value":"REC36PZM4DMLI7LR","created_at":"2026-05-18T12:30:41.710351+00:00"},{"alias_kind":"pith_short_8","alias_value":"REC36PZM","created_at":"2026-05-18T12:30:41.710351+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/REC36PZM4DMLI7LRIMHSFGS3WW","json":"https://pith.science/pith/REC36PZM4DMLI7LRIMHSFGS3WW.json","graph_json":"https://pith.science/api/pith-number/REC36PZM4DMLI7LRIMHSFGS3WW/graph.json","events_json":"https://pith.science/api/pith-number/REC36PZM4DMLI7LRIMHSFGS3WW/events.json","paper":"https://pith.science/paper/REC36PZM"},"agent_actions":{"view_html":"https://pith.science/pith/REC36PZM4DMLI7LRIMHSFGS3WW","download_json":"https://pith.science/pith/REC36PZM4DMLI7LRIMHSFGS3WW.json","view_paper":"https://pith.science/paper/REC36PZM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1606.04607&json=true","fetch_graph":"https://pith.science/api/pith-number/REC36PZM4DMLI7LRIMHSFGS3WW/graph.json","fetch_events":"https://pith.science/api/pith-number/REC36PZM4DMLI7LRIMHSFGS3WW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/REC36PZM4DMLI7LRIMHSFGS3WW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/REC36PZM4DMLI7LRIMHSFGS3WW/action/storage_attestation","attest_author":"https://pith.science/pith/REC36PZM4DMLI7LRIMHSFGS3WW/action/author_attestation","sign_citation":"https://pith.science/pith/REC36PZM4DMLI7LRIMHSFGS3WW/action/citation_signature","submit_replication":"https://pith.science/pith/REC36PZM4DMLI7LRIMHSFGS3WW/action/replication_record"}},"created_at":"2026-05-18T01:12:24.707382+00:00","updated_at":"2026-05-18T01:12:24.707382+00:00"}