{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:GZTFD5ESEOAZAOJHDG5J7LBEJH","short_pith_number":"pith:GZTFD5ES","schema_version":"1.0","canonical_sha256":"366651f492238190392719ba9fac2449eae9e59555335cc416d70ef71ac35bc4","source":{"kind":"arxiv","id":"1802.10142","version":1},"attestation_state":"computed","paper":{"title":"On the structure of the fundamental subspaces of acyclic matrices with $0$ in the diagonal","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Adri\\'an Pastine, Daniel A. Jaume","submitted_at":"2018-02-27T20:02:48Z","abstract_excerpt":"A matrix is called acyclic if replacing the diagonal entries with $0$, and the nonzero diagonal entries with $1$, yields the adjacency matrix of a forest. In this paper we show that null space and the rank of a acyclic matrix with $0$ in the diagonal is obtained from the null space and the rank of the adjacency matrix of the forest by multipliying by non-singular diagonal matrices. We combine these methods with an algorithm for finding a sparsest basis of the null space of a forest to provide an optimal time algorithm for finding a sparsest basis of the null space of acyclic matrices with $0$ "},"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":"1802.10142","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-02-27T20:02:48Z","cross_cats_sorted":[],"title_canon_sha256":"dee53f7fa2ec52b717bca7f8a16d5cdb5c749db413795c04eeb7d780c3b6b993","abstract_canon_sha256":"8b10711b15268b640c5d83cad341b5ff1498d0d10f05c33e05124a33bf2d0f06"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:22:18.028674Z","signature_b64":"4THFpz8wuVKK+xKqcEpiKCOo1hoSr3WPyR04a49Le3VvQX4kH20xFPP+U+wylTw1L5Pnyoh/LIOIOIMk17FPAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"366651f492238190392719ba9fac2449eae9e59555335cc416d70ef71ac35bc4","last_reissued_at":"2026-05-18T00:22:18.028079Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:22:18.028079Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the structure of the fundamental subspaces of acyclic matrices with $0$ in the diagonal","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Adri\\'an Pastine, Daniel A. Jaume","submitted_at":"2018-02-27T20:02:48Z","abstract_excerpt":"A matrix is called acyclic if replacing the diagonal entries with $0$, and the nonzero diagonal entries with $1$, yields the adjacency matrix of a forest. In this paper we show that null space and the rank of a acyclic matrix with $0$ in the diagonal is obtained from the null space and the rank of the adjacency matrix of the forest by multipliying by non-singular diagonal matrices. We combine these methods with an algorithm for finding a sparsest basis of the null space of a forest to provide an optimal time algorithm for finding a sparsest basis of the null space of acyclic matrices with $0$ "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.10142","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":"1802.10142","created_at":"2026-05-18T00:22:18.028184+00:00"},{"alias_kind":"arxiv_version","alias_value":"1802.10142v1","created_at":"2026-05-18T00:22:18.028184+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.10142","created_at":"2026-05-18T00:22:18.028184+00:00"},{"alias_kind":"pith_short_12","alias_value":"GZTFD5ESEOAZ","created_at":"2026-05-18T12:32:25.280505+00:00"},{"alias_kind":"pith_short_16","alias_value":"GZTFD5ESEOAZAOJH","created_at":"2026-05-18T12:32:25.280505+00:00"},{"alias_kind":"pith_short_8","alias_value":"GZTFD5ES","created_at":"2026-05-18T12:32:25.280505+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/GZTFD5ESEOAZAOJHDG5J7LBEJH","json":"https://pith.science/pith/GZTFD5ESEOAZAOJHDG5J7LBEJH.json","graph_json":"https://pith.science/api/pith-number/GZTFD5ESEOAZAOJHDG5J7LBEJH/graph.json","events_json":"https://pith.science/api/pith-number/GZTFD5ESEOAZAOJHDG5J7LBEJH/events.json","paper":"https://pith.science/paper/GZTFD5ES"},"agent_actions":{"view_html":"https://pith.science/pith/GZTFD5ESEOAZAOJHDG5J7LBEJH","download_json":"https://pith.science/pith/GZTFD5ESEOAZAOJHDG5J7LBEJH.json","view_paper":"https://pith.science/paper/GZTFD5ES","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1802.10142&json=true","fetch_graph":"https://pith.science/api/pith-number/GZTFD5ESEOAZAOJHDG5J7LBEJH/graph.json","fetch_events":"https://pith.science/api/pith-number/GZTFD5ESEOAZAOJHDG5J7LBEJH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GZTFD5ESEOAZAOJHDG5J7LBEJH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GZTFD5ESEOAZAOJHDG5J7LBEJH/action/storage_attestation","attest_author":"https://pith.science/pith/GZTFD5ESEOAZAOJHDG5J7LBEJH/action/author_attestation","sign_citation":"https://pith.science/pith/GZTFD5ESEOAZAOJHDG5J7LBEJH/action/citation_signature","submit_replication":"https://pith.science/pith/GZTFD5ESEOAZAOJHDG5J7LBEJH/action/replication_record"}},"created_at":"2026-05-18T00:22:18.028184+00:00","updated_at":"2026-05-18T00:22:18.028184+00:00"}