{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:YHQUPN4GWLEQESJY6U3IMAGEMZ","short_pith_number":"pith:YHQUPN4G","schema_version":"1.0","canonical_sha256":"c1e147b786b2c9024938f5368600c4665726cf5bec970bba6fe82bd68955de69","source":{"kind":"arxiv","id":"1707.01667","version":2},"attestation_state":"computed","paper":{"title":"The Matroid Structure of Representative Triple Sets and Triple-Closure Computation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Carsten R. Seemann, Marc Hellmuth","submitted_at":"2017-07-06T07:55:37Z","abstract_excerpt":"The closure $\\textrm{cl}(R)$ of a consistent set $R$ of triples (rooted binary trees on three leaves) provides essential information about tree-like relations that are shown by any supertree that displays all triples in $R$. In this contribution, we are concerned with representative triple sets, that is, subsets $R'$ of $R$ with $\\textrm{cl}(R') = \\textrm{cl}(R)$. In this case, $R'$ still contains all information on the tree structure implied by $R$, although $R'$ might be significantly smaller. We show that representative triple sets that are minimal w.r.t.\\ inclusion form the basis of a matr"},"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":"1707.01667","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-07-06T07:55:37Z","cross_cats_sorted":[],"title_canon_sha256":"428d575f7f0cd7d2b4e9ac0488cce6590324b1e5960f2e98cfceb2e6128c0066","abstract_canon_sha256":"9ca7679ca2105c457a37f53205324157e9433dfef38a22d19a8b3f73a6bcd3ac"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:23:02.274868Z","signature_b64":"GYOTVL80Y/gM/yLEa8EvnYsXuXFfjR5FGBWd2aZlErZUmceKFeF2G+Q2BvrCXi6xvmRh79z/fzJ0CFs9thptBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c1e147b786b2c9024938f5368600c4665726cf5bec970bba6fe82bd68955de69","last_reissued_at":"2026-07-05T03:23:02.274488Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:23:02.274488Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Matroid Structure of Representative Triple Sets and Triple-Closure Computation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Carsten R. Seemann, Marc Hellmuth","submitted_at":"2017-07-06T07:55:37Z","abstract_excerpt":"The closure $\\textrm{cl}(R)$ of a consistent set $R$ of triples (rooted binary trees on three leaves) provides essential information about tree-like relations that are shown by any supertree that displays all triples in $R$. In this contribution, we are concerned with representative triple sets, that is, subsets $R'$ of $R$ with $\\textrm{cl}(R') = \\textrm{cl}(R)$. In this case, $R'$ still contains all information on the tree structure implied by $R$, although $R'$ might be significantly smaller. We show that representative triple sets that are minimal w.r.t.\\ inclusion form the basis of a matr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.01667","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/1707.01667/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":"1707.01667","created_at":"2026-07-05T03:23:02.274546+00:00"},{"alias_kind":"arxiv_version","alias_value":"1707.01667v2","created_at":"2026-07-05T03:23:02.274546+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.01667","created_at":"2026-07-05T03:23:02.274546+00:00"},{"alias_kind":"pith_short_12","alias_value":"YHQUPN4GWLEQ","created_at":"2026-07-05T03:23:02.274546+00:00"},{"alias_kind":"pith_short_16","alias_value":"YHQUPN4GWLEQESJY","created_at":"2026-07-05T03:23:02.274546+00:00"},{"alias_kind":"pith_short_8","alias_value":"YHQUPN4G","created_at":"2026-07-05T03:23:02.274546+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/YHQUPN4GWLEQESJY6U3IMAGEMZ","json":"https://pith.science/pith/YHQUPN4GWLEQESJY6U3IMAGEMZ.json","graph_json":"https://pith.science/api/pith-number/YHQUPN4GWLEQESJY6U3IMAGEMZ/graph.json","events_json":"https://pith.science/api/pith-number/YHQUPN4GWLEQESJY6U3IMAGEMZ/events.json","paper":"https://pith.science/paper/YHQUPN4G"},"agent_actions":{"view_html":"https://pith.science/pith/YHQUPN4GWLEQESJY6U3IMAGEMZ","download_json":"https://pith.science/pith/YHQUPN4GWLEQESJY6U3IMAGEMZ.json","view_paper":"https://pith.science/paper/YHQUPN4G","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1707.01667&json=true","fetch_graph":"https://pith.science/api/pith-number/YHQUPN4GWLEQESJY6U3IMAGEMZ/graph.json","fetch_events":"https://pith.science/api/pith-number/YHQUPN4GWLEQESJY6U3IMAGEMZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YHQUPN4GWLEQESJY6U3IMAGEMZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YHQUPN4GWLEQESJY6U3IMAGEMZ/action/storage_attestation","attest_author":"https://pith.science/pith/YHQUPN4GWLEQESJY6U3IMAGEMZ/action/author_attestation","sign_citation":"https://pith.science/pith/YHQUPN4GWLEQESJY6U3IMAGEMZ/action/citation_signature","submit_replication":"https://pith.science/pith/YHQUPN4GWLEQESJY6U3IMAGEMZ/action/replication_record"}},"created_at":"2026-07-05T03:23:02.274546+00:00","updated_at":"2026-07-05T03:23:02.274546+00:00"}