{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:HOEGRB2NWILII2XUEIGUKSFASW","short_pith_number":"pith:HOEGRB2N","schema_version":"1.0","canonical_sha256":"3b8868874db216846af4220d4548a09581d337d03bfe1c9cbb19f06cf70c2976","source":{"kind":"arxiv","id":"1809.03364","version":1},"attestation_state":"computed","paper":{"title":"The ancestral matrix of a rooted tree","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Eric O. D. Andriantiana, Kenneth Dadedzi, Stephan Wagner","submitted_at":"2018-09-10T14:47:53Z","abstract_excerpt":"Given a rooted tree $T$ with leaves $v_1,v_2,\\ldots,v_n$, we define the ancestral matrix $C(T)$ of $T$ to be the $n \\times n$ matrix for which the entry in the $i$-th row, $j$-th column is the level (distance from the root) of the first common ancestor of $v_i$ and $v_j$. We study properties of this matrix, in particular regarding its spectrum: we obtain several upper and lower bounds for the eigenvalues in terms of other tree parameters. We also find a combinatorial interpretation for the coefficients of the characteristic polynomial of $C(T)$, and show that for $d$-ary trees, a specific valu"},"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":"1809.03364","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-09-10T14:47:53Z","cross_cats_sorted":[],"title_canon_sha256":"df7b7c4e94aa5a00577722d187d846d92f320c33f6336acecf57349284a2a467","abstract_canon_sha256":"eb0dab4c7538a0982e78280ae671d2beca0bf2d2cd2aaefb99fc1d8c5e26eacb"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:06:07.077389Z","signature_b64":"JYPezW1e2hZCj7N0lxOwWEzXxSNQCd4ORjJc3AuWCj0krbynCHc+BOEn5unIUCPTShsXK+bVRewGun1J37mYCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3b8868874db216846af4220d4548a09581d337d03bfe1c9cbb19f06cf70c2976","last_reissued_at":"2026-05-18T00:06:07.076780Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:06:07.076780Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The ancestral matrix of a rooted tree","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Eric O. D. Andriantiana, Kenneth Dadedzi, Stephan Wagner","submitted_at":"2018-09-10T14:47:53Z","abstract_excerpt":"Given a rooted tree $T$ with leaves $v_1,v_2,\\ldots,v_n$, we define the ancestral matrix $C(T)$ of $T$ to be the $n \\times n$ matrix for which the entry in the $i$-th row, $j$-th column is the level (distance from the root) of the first common ancestor of $v_i$ and $v_j$. We study properties of this matrix, in particular regarding its spectrum: we obtain several upper and lower bounds for the eigenvalues in terms of other tree parameters. We also find a combinatorial interpretation for the coefficients of the characteristic polynomial of $C(T)$, and show that for $d$-ary trees, a specific valu"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1809.03364","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":"1809.03364","created_at":"2026-05-18T00:06:07.076881+00:00"},{"alias_kind":"arxiv_version","alias_value":"1809.03364v1","created_at":"2026-05-18T00:06:07.076881+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.03364","created_at":"2026-05-18T00:06:07.076881+00:00"},{"alias_kind":"pith_short_12","alias_value":"HOEGRB2NWILI","created_at":"2026-05-18T12:32:28.185984+00:00"},{"alias_kind":"pith_short_16","alias_value":"HOEGRB2NWILII2XU","created_at":"2026-05-18T12:32:28.185984+00:00"},{"alias_kind":"pith_short_8","alias_value":"HOEGRB2N","created_at":"2026-05-18T12:32:28.185984+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/HOEGRB2NWILII2XUEIGUKSFASW","json":"https://pith.science/pith/HOEGRB2NWILII2XUEIGUKSFASW.json","graph_json":"https://pith.science/api/pith-number/HOEGRB2NWILII2XUEIGUKSFASW/graph.json","events_json":"https://pith.science/api/pith-number/HOEGRB2NWILII2XUEIGUKSFASW/events.json","paper":"https://pith.science/paper/HOEGRB2N"},"agent_actions":{"view_html":"https://pith.science/pith/HOEGRB2NWILII2XUEIGUKSFASW","download_json":"https://pith.science/pith/HOEGRB2NWILII2XUEIGUKSFASW.json","view_paper":"https://pith.science/paper/HOEGRB2N","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1809.03364&json=true","fetch_graph":"https://pith.science/api/pith-number/HOEGRB2NWILII2XUEIGUKSFASW/graph.json","fetch_events":"https://pith.science/api/pith-number/HOEGRB2NWILII2XUEIGUKSFASW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HOEGRB2NWILII2XUEIGUKSFASW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HOEGRB2NWILII2XUEIGUKSFASW/action/storage_attestation","attest_author":"https://pith.science/pith/HOEGRB2NWILII2XUEIGUKSFASW/action/author_attestation","sign_citation":"https://pith.science/pith/HOEGRB2NWILII2XUEIGUKSFASW/action/citation_signature","submit_replication":"https://pith.science/pith/HOEGRB2NWILII2XUEIGUKSFASW/action/replication_record"}},"created_at":"2026-05-18T00:06:07.076881+00:00","updated_at":"2026-05-18T00:06:07.076881+00:00"}