{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:3ZDM6WMDG25VTQ63H45UMU55MV","short_pith_number":"pith:3ZDM6WMD","schema_version":"1.0","canonical_sha256":"de46cf598336bb59c3db3f3b4653bd6568c90d8833b2862a8826d02e0a511ef3","source":{"kind":"arxiv","id":"1609.02399","version":1},"attestation_state":"computed","paper":{"title":"An Explicit Formula for the Eigenvectors of Acyclic Matrices and Weighted Trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Asghar Bahmani, Dariush Kiani","submitted_at":"2016-09-08T12:44:47Z","abstract_excerpt":"Let $A$ be an acyclic symmetric matrix of order $n$. There is a weighted forest $F$ whose adjacency matrix is $A$. In this paper, using some results on matching polynomials, we provide an explicit formula for eigenvectors of $A$."},"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":"1609.02399","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-09-08T12:44:47Z","cross_cats_sorted":[],"title_canon_sha256":"bc91b50cfda44c4df8a45336d189adeeea033ccf421db36eb446bd45332ccbc9","abstract_canon_sha256":"cfb5b2dfefa2dbbd8793281f50055b89c9e5cfde08796cdd2739869dad08cace"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:04:54.763943Z","signature_b64":"aYlyNgJsSC0e+7xfaBYaidAqDbqbA7b+E59ZTYp4sGWB+0uyEfHcjDgE/0nVv1a3GH6eA+/KwBUym7JIvIpNAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"de46cf598336bb59c3db3f3b4653bd6568c90d8833b2862a8826d02e0a511ef3","last_reissued_at":"2026-05-18T01:04:54.763304Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:04:54.763304Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"An Explicit Formula for the Eigenvectors of Acyclic Matrices and Weighted Trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Asghar Bahmani, Dariush Kiani","submitted_at":"2016-09-08T12:44:47Z","abstract_excerpt":"Let $A$ be an acyclic symmetric matrix of order $n$. There is a weighted forest $F$ whose adjacency matrix is $A$. In this paper, using some results on matching polynomials, we provide an explicit formula for eigenvectors of $A$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1609.02399","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":"1609.02399","created_at":"2026-05-18T01:04:54.763412+00:00"},{"alias_kind":"arxiv_version","alias_value":"1609.02399v1","created_at":"2026-05-18T01:04:54.763412+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1609.02399","created_at":"2026-05-18T01:04:54.763412+00:00"},{"alias_kind":"pith_short_12","alias_value":"3ZDM6WMDG25V","created_at":"2026-05-18T12:29:58.707656+00:00"},{"alias_kind":"pith_short_16","alias_value":"3ZDM6WMDG25VTQ63","created_at":"2026-05-18T12:29:58.707656+00:00"},{"alias_kind":"pith_short_8","alias_value":"3ZDM6WMD","created_at":"2026-05-18T12:29:58.707656+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/3ZDM6WMDG25VTQ63H45UMU55MV","json":"https://pith.science/pith/3ZDM6WMDG25VTQ63H45UMU55MV.json","graph_json":"https://pith.science/api/pith-number/3ZDM6WMDG25VTQ63H45UMU55MV/graph.json","events_json":"https://pith.science/api/pith-number/3ZDM6WMDG25VTQ63H45UMU55MV/events.json","paper":"https://pith.science/paper/3ZDM6WMD"},"agent_actions":{"view_html":"https://pith.science/pith/3ZDM6WMDG25VTQ63H45UMU55MV","download_json":"https://pith.science/pith/3ZDM6WMDG25VTQ63H45UMU55MV.json","view_paper":"https://pith.science/paper/3ZDM6WMD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1609.02399&json=true","fetch_graph":"https://pith.science/api/pith-number/3ZDM6WMDG25VTQ63H45UMU55MV/graph.json","fetch_events":"https://pith.science/api/pith-number/3ZDM6WMDG25VTQ63H45UMU55MV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3ZDM6WMDG25VTQ63H45UMU55MV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3ZDM6WMDG25VTQ63H45UMU55MV/action/storage_attestation","attest_author":"https://pith.science/pith/3ZDM6WMDG25VTQ63H45UMU55MV/action/author_attestation","sign_citation":"https://pith.science/pith/3ZDM6WMDG25VTQ63H45UMU55MV/action/citation_signature","submit_replication":"https://pith.science/pith/3ZDM6WMDG25VTQ63H45UMU55MV/action/replication_record"}},"created_at":"2026-05-18T01:04:54.763412+00:00","updated_at":"2026-05-18T01:04:54.763412+00:00"}