{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:TJJBNQGSDDSOXYIKHPILN6H7NW","short_pith_number":"pith:TJJBNQGS","schema_version":"1.0","canonical_sha256":"9a5216c0d218e4ebe10a3bd0b6f8ff6d84db5a91d850c9840424e92fc822ea6c","source":{"kind":"arxiv","id":"2406.18713","version":1},"attestation_state":"computed","paper":{"title":"Network Representation and Modular Decomposition of Combinatorial Structures: A Galled-Tree Perspective","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Anna Lindeberg, Guillaume E. Scholz, Marc Hellmuth","submitted_at":"2024-06-26T19:28:05Z","abstract_excerpt":"In phylogenetics, reconstructing rooted trees from distances between taxa is a common task. B\\\"ocker and Dress generalized this concept by introducing symbolic dated maps $\\delta:X \\times X \\to \\Upsilon$, where distances are replaced by symbols, and showed that there is a one-to-one correspondence between symbolic ultrametrics and labeled rooted phylogenetic trees. Many combinatorial structures fall under the umbrella of symbolic dated maps, such as 2-dissimilarities, symmetric labeled 2-structures, or edge-colored complete graphs, and are here referred to as strudigrams. Strudigrams have a un"},"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":"2406.18713","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2024-06-26T19:28:05Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"1ba8670756362dc33b5f9c726849b7a6b66f3e2a5d9805de3e28b02ba8112ff0","abstract_canon_sha256":"de4dc8c67b6da8de3a20c51e192f6c829dee66d3ef396a1e5a93eb225acdf1a2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:37:24.884651Z","signature_b64":"cNlKQ/qQhi5PWBoO6PfYxw9Fr1bJ9Tqb94vDYkwSa9cpZ8VTTcivsBjPqjRiZst34C9oXu8HHIcOO0hDXA1VAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9a5216c0d218e4ebe10a3bd0b6f8ff6d84db5a91d850c9840424e92fc822ea6c","last_reissued_at":"2026-07-05T08:37:24.884184Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:37:24.884184Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Network Representation and Modular Decomposition of Combinatorial Structures: A Galled-Tree Perspective","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Anna Lindeberg, Guillaume E. Scholz, Marc Hellmuth","submitted_at":"2024-06-26T19:28:05Z","abstract_excerpt":"In phylogenetics, reconstructing rooted trees from distances between taxa is a common task. B\\\"ocker and Dress generalized this concept by introducing symbolic dated maps $\\delta:X \\times X \\to \\Upsilon$, where distances are replaced by symbols, and showed that there is a one-to-one correspondence between symbolic ultrametrics and labeled rooted phylogenetic trees. Many combinatorial structures fall under the umbrella of symbolic dated maps, such as 2-dissimilarities, symmetric labeled 2-structures, or edge-colored complete graphs, and are here referred to as strudigrams. Strudigrams have a un"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2406.18713","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2406.18713/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":"2406.18713","created_at":"2026-07-05T08:37:24.884240+00:00"},{"alias_kind":"arxiv_version","alias_value":"2406.18713v1","created_at":"2026-07-05T08:37:24.884240+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2406.18713","created_at":"2026-07-05T08:37:24.884240+00:00"},{"alias_kind":"pith_short_12","alias_value":"TJJBNQGSDDSO","created_at":"2026-07-05T08:37:24.884240+00:00"},{"alias_kind":"pith_short_16","alias_value":"TJJBNQGSDDSOXYIK","created_at":"2026-07-05T08:37:24.884240+00:00"},{"alias_kind":"pith_short_8","alias_value":"TJJBNQGS","created_at":"2026-07-05T08:37:24.884240+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2502.08746","citing_title":"Orthology and Near-Cographs in the Context of Phylogenetic Networks","ref_index":58,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/TJJBNQGSDDSOXYIKHPILN6H7NW","json":"https://pith.science/pith/TJJBNQGSDDSOXYIKHPILN6H7NW.json","graph_json":"https://pith.science/api/pith-number/TJJBNQGSDDSOXYIKHPILN6H7NW/graph.json","events_json":"https://pith.science/api/pith-number/TJJBNQGSDDSOXYIKHPILN6H7NW/events.json","paper":"https://pith.science/paper/TJJBNQGS"},"agent_actions":{"view_html":"https://pith.science/pith/TJJBNQGSDDSOXYIKHPILN6H7NW","download_json":"https://pith.science/pith/TJJBNQGSDDSOXYIKHPILN6H7NW.json","view_paper":"https://pith.science/paper/TJJBNQGS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2406.18713&json=true","fetch_graph":"https://pith.science/api/pith-number/TJJBNQGSDDSOXYIKHPILN6H7NW/graph.json","fetch_events":"https://pith.science/api/pith-number/TJJBNQGSDDSOXYIKHPILN6H7NW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TJJBNQGSDDSOXYIKHPILN6H7NW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TJJBNQGSDDSOXYIKHPILN6H7NW/action/storage_attestation","attest_author":"https://pith.science/pith/TJJBNQGSDDSOXYIKHPILN6H7NW/action/author_attestation","sign_citation":"https://pith.science/pith/TJJBNQGSDDSOXYIKHPILN6H7NW/action/citation_signature","submit_replication":"https://pith.science/pith/TJJBNQGSDDSOXYIKHPILN6H7NW/action/replication_record"}},"created_at":"2026-07-05T08:37:24.884240+00:00","updated_at":"2026-07-05T08:37:24.884240+00:00"}