{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:GZTFD5ESEOAZAOJHDG5J7LBEJH","short_pith_number":"pith:GZTFD5ES","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"},"canonical_sha256":"366651f492238190392719ba9fac2449eae9e59555335cc416d70ef71ac35bc4","source":{"kind":"arxiv","id":"1802.10142","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1802.10142","created_at":"2026-05-18T00:22:18Z"},{"alias_kind":"arxiv_version","alias_value":"1802.10142v1","created_at":"2026-05-18T00:22:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.10142","created_at":"2026-05-18T00:22:18Z"},{"alias_kind":"pith_short_12","alias_value":"GZTFD5ESEOAZ","created_at":"2026-05-18T12:32:25Z"},{"alias_kind":"pith_short_16","alias_value":"GZTFD5ESEOAZAOJH","created_at":"2026-05-18T12:32:25Z"},{"alias_kind":"pith_short_8","alias_value":"GZTFD5ES","created_at":"2026-05-18T12:32:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:GZTFD5ESEOAZAOJHDG5J7LBEJH","target":"record","payload":{"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"},"canonical_sha256":"366651f492238190392719ba9fac2449eae9e59555335cc416d70ef71ac35bc4","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"},"source_kind":"arxiv","source_id":"1802.10142","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:22:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ltoZfo1d81JgDs8LSt9RCqYuOxCmioAiSERt8ooOJ3abTOIbBlGalSv6t6a4Hko0Y9M2HvNm40wmienuR4CnCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T08:36:05.003246Z"},"content_sha256":"ebd9ddf34eac9595a0c68c462ced85c0a801c1ab109074fba8e85407a0c52dfd","schema_version":"1.0","event_id":"sha256:ebd9ddf34eac9595a0c68c462ced85c0a801c1ab109074fba8e85407a0c52dfd"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:GZTFD5ESEOAZAOJHDG5J7LBEJH","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:22:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/G3BP4+FGebuHfPfhTFP5DhN8SefkM6rtkbGs/xDw3VPNrOpdBl6igm04Dv9g8rjBAhnO2ezIYLyBqqUWuOFBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T08:36:05.003902Z"},"content_sha256":"5ab9d6fffaef7149fbc0d5525352d28520d0e0789f2309b816a6b4dd99c65ce0","schema_version":"1.0","event_id":"sha256:5ab9d6fffaef7149fbc0d5525352d28520d0e0789f2309b816a6b4dd99c65ce0"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GZTFD5ESEOAZAOJHDG5J7LBEJH/bundle.json","state_url":"https://pith.science/pith/GZTFD5ESEOAZAOJHDG5J7LBEJH/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GZTFD5ESEOAZAOJHDG5J7LBEJH/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-27T08:36:05Z","links":{"resolver":"https://pith.science/pith/GZTFD5ESEOAZAOJHDG5J7LBEJH","bundle":"https://pith.science/pith/GZTFD5ESEOAZAOJHDG5J7LBEJH/bundle.json","state":"https://pith.science/pith/GZTFD5ESEOAZAOJHDG5J7LBEJH/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GZTFD5ESEOAZAOJHDG5J7LBEJH/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:GZTFD5ESEOAZAOJHDG5J7LBEJH","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"8b10711b15268b640c5d83cad341b5ff1498d0d10f05c33e05124a33bf2d0f06","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-02-27T20:02:48Z","title_canon_sha256":"dee53f7fa2ec52b717bca7f8a16d5cdb5c749db413795c04eeb7d780c3b6b993"},"schema_version":"1.0","source":{"id":"1802.10142","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1802.10142","created_at":"2026-05-18T00:22:18Z"},{"alias_kind":"arxiv_version","alias_value":"1802.10142v1","created_at":"2026-05-18T00:22:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.10142","created_at":"2026-05-18T00:22:18Z"},{"alias_kind":"pith_short_12","alias_value":"GZTFD5ESEOAZ","created_at":"2026-05-18T12:32:25Z"},{"alias_kind":"pith_short_16","alias_value":"GZTFD5ESEOAZAOJH","created_at":"2026-05-18T12:32:25Z"},{"alias_kind":"pith_short_8","alias_value":"GZTFD5ES","created_at":"2026-05-18T12:32:25Z"}],"graph_snapshots":[{"event_id":"sha256:5ab9d6fffaef7149fbc0d5525352d28520d0e0789f2309b816a6b4dd99c65ce0","target":"graph","created_at":"2026-05-18T00:22:18Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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$ ","authors_text":"Adri\\'an Pastine, Daniel A. Jaume","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-02-27T20:02:48Z","title":"On the structure of the fundamental subspaces of acyclic matrices with $0$ in the diagonal"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.10142","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:ebd9ddf34eac9595a0c68c462ced85c0a801c1ab109074fba8e85407a0c52dfd","target":"record","created_at":"2026-05-18T00:22:18Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"8b10711b15268b640c5d83cad341b5ff1498d0d10f05c33e05124a33bf2d0f06","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-02-27T20:02:48Z","title_canon_sha256":"dee53f7fa2ec52b717bca7f8a16d5cdb5c749db413795c04eeb7d780c3b6b993"},"schema_version":"1.0","source":{"id":"1802.10142","kind":"arxiv","version":1}},"canonical_sha256":"366651f492238190392719ba9fac2449eae9e59555335cc416d70ef71ac35bc4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"366651f492238190392719ba9fac2449eae9e59555335cc416d70ef71ac35bc4","first_computed_at":"2026-05-18T00:22:18.028079Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:22:18.028079Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"4THFpz8wuVKK+xKqcEpiKCOo1hoSr3WPyR04a49Le3VvQX4kH20xFPP+U+wylTw1L5Pnyoh/LIOIOIMk17FPAg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:22:18.028674Z","signed_message":"canonical_sha256_bytes"},"source_id":"1802.10142","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ebd9ddf34eac9595a0c68c462ced85c0a801c1ab109074fba8e85407a0c52dfd","sha256:5ab9d6fffaef7149fbc0d5525352d28520d0e0789f2309b816a6b4dd99c65ce0"],"state_sha256":"b338d350bd1c99a278c72e5d423ce70f8077c9ad63dc1a7c7be271821f997a1c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vt7aqUpSKK4Nzap+Mi2NcOJCnUi7ADvXWRIROstvhaxKsb0QGCzBJ5PJHQegKr3wY+ad35vEIff3PGX9/VlkAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T08:36:05.007285Z","bundle_sha256":"a754c1bcffb572e68d66db26b9063396cbba91e042a4d95308bb802549166988"}}