{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2023:B72B4HX43ESGHRZDYUYVVI4W4T","short_pith_number":"pith:B72B4HX4","canonical_record":{"source":{"id":"2306.14236","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2023-06-25T13:03:06Z","cross_cats_sorted":[],"title_canon_sha256":"0e631727fad7a780969549f1384eddf51468cc0130f819119767ff8d9791fa91","abstract_canon_sha256":"0300c826df7d0f8e5162b6e636e27f2412af7b3f65945e43ce4ddb845fb0a082"},"schema_version":"1.0"},"canonical_sha256":"0ff41e1efcd92463c723c5315aa396e4d5aa8ea5ba8a5279956f73bb27dc53f9","source":{"kind":"arxiv","id":"2306.14236","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2306.14236","created_at":"2026-07-05T06:31:12Z"},{"alias_kind":"arxiv_version","alias_value":"2306.14236v2","created_at":"2026-07-05T06:31:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2306.14236","created_at":"2026-07-05T06:31:12Z"},{"alias_kind":"pith_short_12","alias_value":"B72B4HX43ESG","created_at":"2026-07-05T06:31:12Z"},{"alias_kind":"pith_short_16","alias_value":"B72B4HX43ESGHRZD","created_at":"2026-07-05T06:31:12Z"},{"alias_kind":"pith_short_8","alias_value":"B72B4HX4","created_at":"2026-07-05T06:31:12Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2023:B72B4HX43ESGHRZDYUYVVI4W4T","target":"record","payload":{"canonical_record":{"source":{"id":"2306.14236","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2023-06-25T13:03:06Z","cross_cats_sorted":[],"title_canon_sha256":"0e631727fad7a780969549f1384eddf51468cc0130f819119767ff8d9791fa91","abstract_canon_sha256":"0300c826df7d0f8e5162b6e636e27f2412af7b3f65945e43ce4ddb845fb0a082"},"schema_version":"1.0"},"canonical_sha256":"0ff41e1efcd92463c723c5315aa396e4d5aa8ea5ba8a5279956f73bb27dc53f9","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:31:12.535294Z","signature_b64":"FKi5t18GUkKi7TDE3J2+uFnYmbg8B+65eADxMdABLaCPFJUYzj8wbT7zqMEoon/0ws50eccSDxjrABRNLCtaDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0ff41e1efcd92463c723c5315aa396e4d5aa8ea5ba8a5279956f73bb27dc53f9","last_reissued_at":"2026-07-05T06:31:12.534853Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:31:12.534853Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2306.14236","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-07-05T06:31:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bLQjxS9lbW6gYv2nRGWwQ29NwQ3HqS3FnHeh3G0ug1ZWWPBhrxmSPPhywfI7A4OL+1xE5MrrPuOj3TM1+sCuAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T14:53:47.930817Z"},"content_sha256":"5ad2252d7fecd35e95565b9e3696fd9fb637efc5a736f9dbf48937aa7b33ed5b","schema_version":"1.0","event_id":"sha256:5ad2252d7fecd35e95565b9e3696fd9fb637efc5a736f9dbf48937aa7b33ed5b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2023:B72B4HX43ESGHRZDYUYVVI4W4T","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Circuit decompositions of binary matroids","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Bryce Frederickson, Lukas Michel","submitted_at":"2023-06-25T13:03:06Z","abstract_excerpt":"Given a simple Eulerian binary matroid $M$, what is the minimum number of disjoint circuits necessary to decompose $M$? We prove that $|M| / (\\operatorname{rank}(M) + 1)$ many circuits suffice if $M = \\mathbb F_2^n \\setminus \\{0\\}$ is the complete binary matroid, for certain values of $n$, and that $\\mathcal{O}(2^{\\operatorname{rank}(M)} / (\\operatorname{rank}(M) + 1))$ many circuits suffice for general $M$. We also determine the asymptotic behaviour of the minimum number of circuits in an odd-cover of $M$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2306.14236","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/2306.14236/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"},"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-07-05T06:31:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dE/6nNBoq344vBElhKXgsxrTwTr5oltam5SHyITLwUYS4kxKqmDFJJuLuPkjz8/X0RWgh9XMgj/s7qD0rio5DQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T14:53:47.931176Z"},"content_sha256":"edda7e7c895302636db4a8a288ef46057e366d6465adffebb62474090511d93f","schema_version":"1.0","event_id":"sha256:edda7e7c895302636db4a8a288ef46057e366d6465adffebb62474090511d93f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/B72B4HX43ESGHRZDYUYVVI4W4T/bundle.json","state_url":"https://pith.science/pith/B72B4HX43ESGHRZDYUYVVI4W4T/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/B72B4HX43ESGHRZDYUYVVI4W4T/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-07-07T14:53:47Z","links":{"resolver":"https://pith.science/pith/B72B4HX43ESGHRZDYUYVVI4W4T","bundle":"https://pith.science/pith/B72B4HX43ESGHRZDYUYVVI4W4T/bundle.json","state":"https://pith.science/pith/B72B4HX43ESGHRZDYUYVVI4W4T/state.json","well_known_bundle":"https://pith.science/.well-known/pith/B72B4HX43ESGHRZDYUYVVI4W4T/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:B72B4HX43ESGHRZDYUYVVI4W4T","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":"0300c826df7d0f8e5162b6e636e27f2412af7b3f65945e43ce4ddb845fb0a082","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2023-06-25T13:03:06Z","title_canon_sha256":"0e631727fad7a780969549f1384eddf51468cc0130f819119767ff8d9791fa91"},"schema_version":"1.0","source":{"id":"2306.14236","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2306.14236","created_at":"2026-07-05T06:31:12Z"},{"alias_kind":"arxiv_version","alias_value":"2306.14236v2","created_at":"2026-07-05T06:31:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2306.14236","created_at":"2026-07-05T06:31:12Z"},{"alias_kind":"pith_short_12","alias_value":"B72B4HX43ESG","created_at":"2026-07-05T06:31:12Z"},{"alias_kind":"pith_short_16","alias_value":"B72B4HX43ESGHRZD","created_at":"2026-07-05T06:31:12Z"},{"alias_kind":"pith_short_8","alias_value":"B72B4HX4","created_at":"2026-07-05T06:31:12Z"}],"graph_snapshots":[{"event_id":"sha256:edda7e7c895302636db4a8a288ef46057e366d6465adffebb62474090511d93f","target":"graph","created_at":"2026-07-05T06:31:12Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2306.14236/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Given a simple Eulerian binary matroid $M$, what is the minimum number of disjoint circuits necessary to decompose $M$? We prove that $|M| / (\\operatorname{rank}(M) + 1)$ many circuits suffice if $M = \\mathbb F_2^n \\setminus \\{0\\}$ is the complete binary matroid, for certain values of $n$, and that $\\mathcal{O}(2^{\\operatorname{rank}(M)} / (\\operatorname{rank}(M) + 1))$ many circuits suffice for general $M$. We also determine the asymptotic behaviour of the minimum number of circuits in an odd-cover of $M$.","authors_text":"Bryce Frederickson, Lukas Michel","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2023-06-25T13:03:06Z","title":"Circuit decompositions of binary matroids"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2306.14236","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:5ad2252d7fecd35e95565b9e3696fd9fb637efc5a736f9dbf48937aa7b33ed5b","target":"record","created_at":"2026-07-05T06:31:12Z","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":"0300c826df7d0f8e5162b6e636e27f2412af7b3f65945e43ce4ddb845fb0a082","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2023-06-25T13:03:06Z","title_canon_sha256":"0e631727fad7a780969549f1384eddf51468cc0130f819119767ff8d9791fa91"},"schema_version":"1.0","source":{"id":"2306.14236","kind":"arxiv","version":2}},"canonical_sha256":"0ff41e1efcd92463c723c5315aa396e4d5aa8ea5ba8a5279956f73bb27dc53f9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0ff41e1efcd92463c723c5315aa396e4d5aa8ea5ba8a5279956f73bb27dc53f9","first_computed_at":"2026-07-05T06:31:12.534853Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T06:31:12.534853Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"FKi5t18GUkKi7TDE3J2+uFnYmbg8B+65eADxMdABLaCPFJUYzj8wbT7zqMEoon/0ws50eccSDxjrABRNLCtaDg==","signature_status":"signed_v1","signed_at":"2026-07-05T06:31:12.535294Z","signed_message":"canonical_sha256_bytes"},"source_id":"2306.14236","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5ad2252d7fecd35e95565b9e3696fd9fb637efc5a736f9dbf48937aa7b33ed5b","sha256:edda7e7c895302636db4a8a288ef46057e366d6465adffebb62474090511d93f"],"state_sha256":"2e84b6adac15321eee299df1aec6e50a2c6adb52a2723fff5a37bd1ea588f033"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3D4Cmucn8ECkDucCTlMVRNbIZNxFQrhs/23hhvCMrv2gvUlHgfFQCX/3IEpFdol6e4sf6wb0ffcd8SofEk4JAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-07T14:53:47.933408Z","bundle_sha256":"2de23aabfb34823bafc12195e88eb191f321625f09b03a8809d387f86a171df2"}}