{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:SHF4TLETJH6S6MB2DMFQBVQZYT","short_pith_number":"pith:SHF4TLET","schema_version":"1.0","canonical_sha256":"91cbc9ac9349fd2f303a1b0b00d619c4e3bc40d32e53f0d7b064e0d67d8d330f","source":{"kind":"arxiv","id":"2608.01059","version":1},"attestation_state":"computed","paper":{"title":"Joins and ear decompositions beyond graphic matroids","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Chaitanya Nalam, Krist\\'of B\\'erczi, Yuhang Bai","submitted_at":"2026-08-02T07:51:24Z","abstract_excerpt":"For a matroid $M$, a join is a set $J\\subseteq E(M)$ that meets every circuit $C$ in at most $|C|/2$ elements. Let $\\mu(M)$ denote the maximum size of a join. Motivated by Frank's min--max theorem for graphic matroids, we compare $\\mu(M)$ with an ear-decomposition parameter $\\eta(M)=(r(M)+\\varphi(M))/2$, where $\\varphi(M)$ is the minimum number of even lobes in an ear decomposition of $M$. Frank's theorem implies $\\mu(M)=\\eta(M)$ for connected graphic matroids.\n  Here we study how far this equality extends beyond graphic matroids. We show that the exact equality does not hold in general: it al"},"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":"2608.01059","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2026-08-02T07:51:24Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"97ea2fb234ea9462dda2b165ea661f2dd873f5b055f564d6f097ea858ad1c0ed","abstract_canon_sha256":"45adbf7dcae21a94f86bf98bc9677a02fdaaa9f7fc89202f3bf75c35a307a70b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-08-04T01:56:27.264236Z","signature_b64":"7eDE643idMFj9FK6CeaZd1sUoFNXzlyCBn9GUv9tvg103S+/VgbpXkvJZIIktj9wwljMSdjSIUy2Dvs84rf+Bg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"91cbc9ac9349fd2f303a1b0b00d619c4e3bc40d32e53f0d7b064e0d67d8d330f","last_reissued_at":"2026-08-04T01:56:27.262702Z","signature_status":"signed_v1","first_computed_at":"2026-08-04T01:56:27.262702Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Joins and ear decompositions beyond graphic matroids","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Chaitanya Nalam, Krist\\'of B\\'erczi, Yuhang Bai","submitted_at":"2026-08-02T07:51:24Z","abstract_excerpt":"For a matroid $M$, a join is a set $J\\subseteq E(M)$ that meets every circuit $C$ in at most $|C|/2$ elements. Let $\\mu(M)$ denote the maximum size of a join. Motivated by Frank's min--max theorem for graphic matroids, we compare $\\mu(M)$ with an ear-decomposition parameter $\\eta(M)=(r(M)+\\varphi(M))/2$, where $\\varphi(M)$ is the minimum number of even lobes in an ear decomposition of $M$. Frank's theorem implies $\\mu(M)=\\eta(M)$ for connected graphic matroids.\n  Here we study how far this equality extends beyond graphic matroids. We show that the exact equality does not hold in general: it al"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2608.01059","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/2608.01059/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":"2608.01059","created_at":"2026-08-04T01:56:27.264069+00:00"},{"alias_kind":"arxiv_version","alias_value":"2608.01059v1","created_at":"2026-08-04T01:56:27.264069+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2608.01059","created_at":"2026-08-04T01:56:27.264069+00:00"},{"alias_kind":"pith_short_12","alias_value":"SHF4TLETJH6S","created_at":"2026-08-04T01:56:27.264069+00:00"},{"alias_kind":"pith_short_16","alias_value":"SHF4TLETJH6S6MB2","created_at":"2026-08-04T01:56:27.264069+00:00"},{"alias_kind":"pith_short_8","alias_value":"SHF4TLET","created_at":"2026-08-04T01:56:27.264069+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/SHF4TLETJH6S6MB2DMFQBVQZYT","json":"https://pith.science/pith/SHF4TLETJH6S6MB2DMFQBVQZYT.json","graph_json":"https://pith.science/api/pith-number/SHF4TLETJH6S6MB2DMFQBVQZYT/graph.json","events_json":"https://pith.science/api/pith-number/SHF4TLETJH6S6MB2DMFQBVQZYT/events.json","paper":"https://pith.science/paper/SHF4TLET"},"agent_actions":{"view_html":"https://pith.science/pith/SHF4TLETJH6S6MB2DMFQBVQZYT","download_json":"https://pith.science/pith/SHF4TLETJH6S6MB2DMFQBVQZYT.json","view_paper":"https://pith.science/paper/SHF4TLET","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2608.01059&json=true","fetch_graph":"https://pith.science/api/pith-number/SHF4TLETJH6S6MB2DMFQBVQZYT/graph.json","fetch_events":"https://pith.science/api/pith-number/SHF4TLETJH6S6MB2DMFQBVQZYT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SHF4TLETJH6S6MB2DMFQBVQZYT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SHF4TLETJH6S6MB2DMFQBVQZYT/action/storage_attestation","attest_author":"https://pith.science/pith/SHF4TLETJH6S6MB2DMFQBVQZYT/action/author_attestation","sign_citation":"https://pith.science/pith/SHF4TLETJH6S6MB2DMFQBVQZYT/action/citation_signature","submit_replication":"https://pith.science/pith/SHF4TLETJH6S6MB2DMFQBVQZYT/action/replication_record"}},"created_at":"2026-08-04T01:56:27.264069+00:00","updated_at":"2026-08-04T01:56:27.264069+00:00"}