{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:TDQCJHROQQREJSLTBOQJ265CEQ","short_pith_number":"pith:TDQCJHRO","schema_version":"1.0","canonical_sha256":"98e0249e2e842244c9730ba09d7ba22403aa028b8cea6f21fd89d08bc84cda85","source":{"kind":"arxiv","id":"2411.14057","version":2},"attestation_state":"computed","paper":{"title":"Characterizing and Transforming DAGs within the I-LCA Framework","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Anna Lindeberg, Marc Hellmuth","submitted_at":"2024-11-21T12:09:21Z","abstract_excerpt":"We explore the connections between clusters and least common ancestors (LCAs) in directed acyclic graphs (DAGs), focusing on the interplay between so-called $I$-lca-relevant DAGs and DAGs with the $I$-lca-property. Here, $I$ denotes a set of integers. In $I$-lca-relevant DAGs, each vertex is the unique LCA for some subset $A$ of leaves of size $|A|\\in I$, whereas in a DAG with the $I$-lca-property there exists a unique LCA for every subset $A$ of leaves satisfying $|A|\\in I$. We elaborate on the difference between these two properties and establish their close relationship to pre-$I$-ary and $"},"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":"2411.14057","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"math.CO","submitted_at":"2024-11-21T12:09:21Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"747061ac140daf91dcf3753f0beb784566df2142219ea6f55e2e543ec4c57094","abstract_canon_sha256":"50c1a886ba56f0ff31ef3753eb7f2e011cca39cf949a1d0f2e42d86113d2aa4c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:51:19.281799Z","signature_b64":"dzaQxwdIBJxifcqH1CZXU5GM59SH2QcNyY3pP8C18z5Esktt70Ynqq1M0uC7hwFHhAPnOeEyfCWS/MLhqLvbCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"98e0249e2e842244c9730ba09d7ba22403aa028b8cea6f21fd89d08bc84cda85","last_reissued_at":"2026-07-05T11:51:19.281273Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:51:19.281273Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Characterizing and Transforming DAGs within the I-LCA Framework","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Anna Lindeberg, Marc Hellmuth","submitted_at":"2024-11-21T12:09:21Z","abstract_excerpt":"We explore the connections between clusters and least common ancestors (LCAs) in directed acyclic graphs (DAGs), focusing on the interplay between so-called $I$-lca-relevant DAGs and DAGs with the $I$-lca-property. Here, $I$ denotes a set of integers. In $I$-lca-relevant DAGs, each vertex is the unique LCA for some subset $A$ of leaves of size $|A|\\in I$, whereas in a DAG with the $I$-lca-property there exists a unique LCA for every subset $A$ of leaves satisfying $|A|\\in I$. We elaborate on the difference between these two properties and establish their close relationship to pre-$I$-ary and $"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2411.14057","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2411.14057/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2411.14057","created_at":"2026-07-05T11:51:19.281342+00:00"},{"alias_kind":"arxiv_version","alias_value":"2411.14057v2","created_at":"2026-07-05T11:51:19.281342+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2411.14057","created_at":"2026-07-05T11:51:19.281342+00:00"},{"alias_kind":"pith_short_12","alias_value":"TDQCJHROQQRE","created_at":"2026-07-05T11:51:19.281342+00:00"},{"alias_kind":"pith_short_16","alias_value":"TDQCJHROQQREJSLT","created_at":"2026-07-05T11:51:19.281342+00:00"},{"alias_kind":"pith_short_8","alias_value":"TDQCJHRO","created_at":"2026-07-05T11:51:19.281342+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2503.16186","citing_title":"Global Least Common Ancestor (LCA) Networks","ref_index":15,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/TDQCJHROQQREJSLTBOQJ265CEQ","json":"https://pith.science/pith/TDQCJHROQQREJSLTBOQJ265CEQ.json","graph_json":"https://pith.science/api/pith-number/TDQCJHROQQREJSLTBOQJ265CEQ/graph.json","events_json":"https://pith.science/api/pith-number/TDQCJHROQQREJSLTBOQJ265CEQ/events.json","paper":"https://pith.science/paper/TDQCJHRO"},"agent_actions":{"view_html":"https://pith.science/pith/TDQCJHROQQREJSLTBOQJ265CEQ","download_json":"https://pith.science/pith/TDQCJHROQQREJSLTBOQJ265CEQ.json","view_paper":"https://pith.science/paper/TDQCJHRO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2411.14057&json=true","fetch_graph":"https://pith.science/api/pith-number/TDQCJHROQQREJSLTBOQJ265CEQ/graph.json","fetch_events":"https://pith.science/api/pith-number/TDQCJHROQQREJSLTBOQJ265CEQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TDQCJHROQQREJSLTBOQJ265CEQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TDQCJHROQQREJSLTBOQJ265CEQ/action/storage_attestation","attest_author":"https://pith.science/pith/TDQCJHROQQREJSLTBOQJ265CEQ/action/author_attestation","sign_citation":"https://pith.science/pith/TDQCJHROQQREJSLTBOQJ265CEQ/action/citation_signature","submit_replication":"https://pith.science/pith/TDQCJHROQQREJSLTBOQJ265CEQ/action/replication_record"}},"created_at":"2026-07-05T11:51:19.281342+00:00","updated_at":"2026-07-05T11:51:19.281342+00:00"}