{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:I7XHPVNF33BEFRZXWZWE6GG3CD","short_pith_number":"pith:I7XHPVNF","schema_version":"1.0","canonical_sha256":"47ee77d5a5dec242c737b66c4f18db10f3be8c11010277929e8f0eb1d9112c79","source":{"kind":"arxiv","id":"1507.01259","version":2},"attestation_state":"computed","paper":{"title":"Count Matroids of Group-Labeled Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Rintaro Ikeshita, Shin-ichi Tanigawa","submitted_at":"2015-07-05T19:12:30Z","abstract_excerpt":"A graph $G=(V,E)$ is called $(k,\\ell)$-sparse if $|F|\\leq k|V(F)|-\\ell$ for any nonempty $F\\subseteq E$, where $V(F)$ denotes the set of vertices incident to $F$. It is known that the family of the edge sets of $(k,\\ell)$-sparse subgraphs forms the family of independent sets of a matroid, called the $(k,\\ell)$-count matroid of $G$. In this paper we shall investigate lifts of the $(k,\\ell)$-count matroid by using group labelings on the edge set. By introducing a new notion called near-balancedness, we shall identify a new class of matroids, where the independence condition is described as a cou"},"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":"1507.01259","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-07-05T19:12:30Z","cross_cats_sorted":[],"title_canon_sha256":"7d09acdea54c0bee2e3853d7dd39f68795c715a6d801abbc988c4e7eb6f67440","abstract_canon_sha256":"6cb422277392efadaa4100f2a2659c5a0e674978278f33709dca3e94576e4341"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:11:43.818733Z","signature_b64":"F3zk+SBrjZGGVvla9WRTsSihLqPafRS1jooJk85wEP6Vtbv9OXekWZdui1JqA3mc4ynMAlgmOMsBzzZJwF2CDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"47ee77d5a5dec242c737b66c4f18db10f3be8c11010277929e8f0eb1d9112c79","last_reissued_at":"2026-05-18T01:11:43.818405Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:11:43.818405Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Count Matroids of Group-Labeled Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Rintaro Ikeshita, Shin-ichi Tanigawa","submitted_at":"2015-07-05T19:12:30Z","abstract_excerpt":"A graph $G=(V,E)$ is called $(k,\\ell)$-sparse if $|F|\\leq k|V(F)|-\\ell$ for any nonempty $F\\subseteq E$, where $V(F)$ denotes the set of vertices incident to $F$. It is known that the family of the edge sets of $(k,\\ell)$-sparse subgraphs forms the family of independent sets of a matroid, called the $(k,\\ell)$-count matroid of $G$. In this paper we shall investigate lifts of the $(k,\\ell)$-count matroid by using group labelings on the edge set. By introducing a new notion called near-balancedness, we shall identify a new class of matroids, where the independence condition is described as a cou"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.01259","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":""},"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":"1507.01259","created_at":"2026-05-18T01:11:43.818457+00:00"},{"alias_kind":"arxiv_version","alias_value":"1507.01259v2","created_at":"2026-05-18T01:11:43.818457+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.01259","created_at":"2026-05-18T01:11:43.818457+00:00"},{"alias_kind":"pith_short_12","alias_value":"I7XHPVNF33BE","created_at":"2026-05-18T12:29:25.134429+00:00"},{"alias_kind":"pith_short_16","alias_value":"I7XHPVNF33BEFRZX","created_at":"2026-05-18T12:29:25.134429+00:00"},{"alias_kind":"pith_short_8","alias_value":"I7XHPVNF","created_at":"2026-05-18T12:29:25.134429+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/I7XHPVNF33BEFRZXWZWE6GG3CD","json":"https://pith.science/pith/I7XHPVNF33BEFRZXWZWE6GG3CD.json","graph_json":"https://pith.science/api/pith-number/I7XHPVNF33BEFRZXWZWE6GG3CD/graph.json","events_json":"https://pith.science/api/pith-number/I7XHPVNF33BEFRZXWZWE6GG3CD/events.json","paper":"https://pith.science/paper/I7XHPVNF"},"agent_actions":{"view_html":"https://pith.science/pith/I7XHPVNF33BEFRZXWZWE6GG3CD","download_json":"https://pith.science/pith/I7XHPVNF33BEFRZXWZWE6GG3CD.json","view_paper":"https://pith.science/paper/I7XHPVNF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1507.01259&json=true","fetch_graph":"https://pith.science/api/pith-number/I7XHPVNF33BEFRZXWZWE6GG3CD/graph.json","fetch_events":"https://pith.science/api/pith-number/I7XHPVNF33BEFRZXWZWE6GG3CD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/I7XHPVNF33BEFRZXWZWE6GG3CD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/I7XHPVNF33BEFRZXWZWE6GG3CD/action/storage_attestation","attest_author":"https://pith.science/pith/I7XHPVNF33BEFRZXWZWE6GG3CD/action/author_attestation","sign_citation":"https://pith.science/pith/I7XHPVNF33BEFRZXWZWE6GG3CD/action/citation_signature","submit_replication":"https://pith.science/pith/I7XHPVNF33BEFRZXWZWE6GG3CD/action/replication_record"}},"created_at":"2026-05-18T01:11:43.818457+00:00","updated_at":"2026-05-18T01:11:43.818457+00:00"}