{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:I7XHPVNF33BEFRZXWZWE6GG3CD","short_pith_number":"pith:I7XHPVNF","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"},"canonical_sha256":"47ee77d5a5dec242c737b66c4f18db10f3be8c11010277929e8f0eb1d9112c79","source":{"kind":"arxiv","id":"1507.01259","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1507.01259","created_at":"2026-05-18T01:11:43Z"},{"alias_kind":"arxiv_version","alias_value":"1507.01259v2","created_at":"2026-05-18T01:11:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.01259","created_at":"2026-05-18T01:11:43Z"},{"alias_kind":"pith_short_12","alias_value":"I7XHPVNF33BE","created_at":"2026-05-18T12:29:25Z"},{"alias_kind":"pith_short_16","alias_value":"I7XHPVNF33BEFRZX","created_at":"2026-05-18T12:29:25Z"},{"alias_kind":"pith_short_8","alias_value":"I7XHPVNF","created_at":"2026-05-18T12:29:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:I7XHPVNF33BEFRZXWZWE6GG3CD","target":"record","payload":{"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"},"canonical_sha256":"47ee77d5a5dec242c737b66c4f18db10f3be8c11010277929e8f0eb1d9112c79","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"},"source_kind":"arxiv","source_id":"1507.01259","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:11:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ieDAqZKs6+4K3A9JpJIAoDWPJtyS7+bzOXOJrIhFeT5HWPVBl+Onl54cJFsjDZaDNxFDFw1c3UlRAEzEleqTAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-21T23:05:25.092417Z"},"content_sha256":"7f61929041a4f0fe01ed8f5952c0a73bd1bfafce500d603aad50f017d98b71b8","schema_version":"1.0","event_id":"sha256:7f61929041a4f0fe01ed8f5952c0a73bd1bfafce500d603aad50f017d98b71b8"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:I7XHPVNF33BEFRZXWZWE6GG3CD","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:11:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Um/679rN3yu+dL3r9RJd1wStEQIVITaInKHDKtnb7rUpfaD1GQwirAgMceXTTxGSBaMXKllOWnWi4pELqhj6BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-21T23:05:25.092774Z"},"content_sha256":"1f4d929cefe06c1c451ad7629017016ca4b0261dacf2ad05e3b01bc2fb08918b","schema_version":"1.0","event_id":"sha256:1f4d929cefe06c1c451ad7629017016ca4b0261dacf2ad05e3b01bc2fb08918b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/I7XHPVNF33BEFRZXWZWE6GG3CD/bundle.json","state_url":"https://pith.science/pith/I7XHPVNF33BEFRZXWZWE6GG3CD/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/I7XHPVNF33BEFRZXWZWE6GG3CD/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-21T23:05:25Z","links":{"resolver":"https://pith.science/pith/I7XHPVNF33BEFRZXWZWE6GG3CD","bundle":"https://pith.science/pith/I7XHPVNF33BEFRZXWZWE6GG3CD/bundle.json","state":"https://pith.science/pith/I7XHPVNF33BEFRZXWZWE6GG3CD/state.json","well_known_bundle":"https://pith.science/.well-known/pith/I7XHPVNF33BEFRZXWZWE6GG3CD/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:I7XHPVNF33BEFRZXWZWE6GG3CD","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"6cb422277392efadaa4100f2a2659c5a0e674978278f33709dca3e94576e4341","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-07-05T19:12:30Z","title_canon_sha256":"7d09acdea54c0bee2e3853d7dd39f68795c715a6d801abbc988c4e7eb6f67440"},"schema_version":"1.0","source":{"id":"1507.01259","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1507.01259","created_at":"2026-05-18T01:11:43Z"},{"alias_kind":"arxiv_version","alias_value":"1507.01259v2","created_at":"2026-05-18T01:11:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.01259","created_at":"2026-05-18T01:11:43Z"},{"alias_kind":"pith_short_12","alias_value":"I7XHPVNF33BE","created_at":"2026-05-18T12:29:25Z"},{"alias_kind":"pith_short_16","alias_value":"I7XHPVNF33BEFRZX","created_at":"2026-05-18T12:29:25Z"},{"alias_kind":"pith_short_8","alias_value":"I7XHPVNF","created_at":"2026-05-18T12:29:25Z"}],"graph_snapshots":[{"event_id":"sha256:1f4d929cefe06c1c451ad7629017016ca4b0261dacf2ad05e3b01bc2fb08918b","target":"graph","created_at":"2026-05-18T01:11:43Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Rintaro Ikeshita, Shin-ichi Tanigawa","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-07-05T19:12:30Z","title":"Count Matroids of Group-Labeled Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.01259","kind":"arxiv","version":2},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:7f61929041a4f0fe01ed8f5952c0a73bd1bfafce500d603aad50f017d98b71b8","target":"record","created_at":"2026-05-18T01:11:43Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"6cb422277392efadaa4100f2a2659c5a0e674978278f33709dca3e94576e4341","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-07-05T19:12:30Z","title_canon_sha256":"7d09acdea54c0bee2e3853d7dd39f68795c715a6d801abbc988c4e7eb6f67440"},"schema_version":"1.0","source":{"id":"1507.01259","kind":"arxiv","version":2}},"canonical_sha256":"47ee77d5a5dec242c737b66c4f18db10f3be8c11010277929e8f0eb1d9112c79","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"47ee77d5a5dec242c737b66c4f18db10f3be8c11010277929e8f0eb1d9112c79","first_computed_at":"2026-05-18T01:11:43.818405Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:11:43.818405Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"F3zk+SBrjZGGVvla9WRTsSihLqPafRS1jooJk85wEP6Vtbv9OXekWZdui1JqA3mc4ynMAlgmOMsBzzZJwF2CDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:11:43.818733Z","signed_message":"canonical_sha256_bytes"},"source_id":"1507.01259","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7f61929041a4f0fe01ed8f5952c0a73bd1bfafce500d603aad50f017d98b71b8","sha256:1f4d929cefe06c1c451ad7629017016ca4b0261dacf2ad05e3b01bc2fb08918b"],"state_sha256":"e0b4efa28488f7d901a57aba1a77af214bfc69c60bb46158d3ca047912701c85"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8ES75Ekqu3ibWUQMJBWEqI6prSERgldWJO0vkysmlDM7TTX3aMD0EDAs4QCF8tngFBvRrFferVyflR8aMDZbBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-21T23:05:25.095590Z","bundle_sha256":"0b66e527710c196479802b52dbb9dff4074808d15d0c0fe1273e2b90ebcbeef4"}}