{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:BXIA6MKWCW5CHJPXPKTNPVEYQ6","short_pith_number":"pith:BXIA6MKW","canonical_record":{"source":{"id":"1906.09598","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-06-23T15:44:56Z","cross_cats_sorted":[],"title_canon_sha256":"5002885badb52fb4bd73353ce093cc8d2144584a62a0eb9e49feae7357161bb9","abstract_canon_sha256":"785fa4a8934c33c1990712dd3751e0654115ec5611254b62d5fc8947a79e8ff4"},"schema_version":"1.0"},"canonical_sha256":"0dd00f315615ba23a5f77aa6d7d49887b8ef195f001b606286d99655d1ac1bac","source":{"kind":"arxiv","id":"1906.09598","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1906.09598","created_at":"2026-05-17T23:41:52Z"},{"alias_kind":"arxiv_version","alias_value":"1906.09598v2","created_at":"2026-05-17T23:41:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1906.09598","created_at":"2026-05-17T23:41:52Z"},{"alias_kind":"pith_short_12","alias_value":"BXIA6MKWCW5C","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_16","alias_value":"BXIA6MKWCW5CHJPX","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_8","alias_value":"BXIA6MKW","created_at":"2026-05-18T12:33:12Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:BXIA6MKWCW5CHJPXPKTNPVEYQ6","target":"record","payload":{"canonical_record":{"source":{"id":"1906.09598","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-06-23T15:44:56Z","cross_cats_sorted":[],"title_canon_sha256":"5002885badb52fb4bd73353ce093cc8d2144584a62a0eb9e49feae7357161bb9","abstract_canon_sha256":"785fa4a8934c33c1990712dd3751e0654115ec5611254b62d5fc8947a79e8ff4"},"schema_version":"1.0"},"canonical_sha256":"0dd00f315615ba23a5f77aa6d7d49887b8ef195f001b606286d99655d1ac1bac","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:41:52.779095Z","signature_b64":"x5KXYramHhHFfnK345kVMQrEZgv9pitXoB8Hk1FKtJrFPD7tItrsi5Sa851AsTfqnZT90jcBgnGGz8za/8glCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0dd00f315615ba23a5f77aa6d7d49887b8ef195f001b606286d99655d1ac1bac","last_reissued_at":"2026-05-17T23:41:52.778556Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:41:52.778556Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1906.09598","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-17T23:41:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LkJpelDRzx8NlsWTSJG0DMhLv9PY28nVjQ2EP3kSUvuDpZ0ux9oOA40RQhh1SxU1VJjJ8PTnXzDYwRZrID/YDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-29T08:20:03.452803Z"},"content_sha256":"75a6fc101637a249dc1aae3038c61ba29a3d6f4b089c2a5dbc664d31f1f6b8bc","schema_version":"1.0","event_id":"sha256:75a6fc101637a249dc1aae3038c61ba29a3d6f4b089c2a5dbc664d31f1f6b8bc"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:BXIA6MKWCW5CHJPXPKTNPVEYQ6","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Counting critical subgraphs in $k$-critical graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Jie Ma, Tianchi Yang","submitted_at":"2019-06-23T15:44:56Z","abstract_excerpt":"Gallai asked in 1984 if any $k$-critical graph on $n$ vertices contains at least $n$ distinct $(k-1)$-critical subgraphs. The answer is trivial for $k\\leq 3$. Improving a result of Stiebitz, Abbott and Zhou proved in 1995 that for all $k\\geq 4$, such graph contains $\\Omega(n^{1/(k-1)})$ distinct $(k-1)$-critical subgraphs. Since then no progress had been made until very recently, Hare resolved the case $k=4$ by showing that any $4$-critical graph on $n$ vertices contains at least $(8n-29)/3$ odd cycles.\n  In this paper, we mainly focus on 4-critical graphs and develop some novel tools for coun"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1906.09598","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-17T23:41:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MWJ6i1haCs7WtrWhI8Iq0tr44a2rwJBIhxHcXEyGIutOp7Iu+wbwZgO6CvjUzRfloRRvIdFwyj7i1P7PDdmsDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-29T08:20:03.453140Z"},"content_sha256":"7de9b602a73fa74af8a23dbc7691189e515cf1c12896b72927702d1d3bbe56cd","schema_version":"1.0","event_id":"sha256:7de9b602a73fa74af8a23dbc7691189e515cf1c12896b72927702d1d3bbe56cd"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BXIA6MKWCW5CHJPXPKTNPVEYQ6/bundle.json","state_url":"https://pith.science/pith/BXIA6MKWCW5CHJPXPKTNPVEYQ6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BXIA6MKWCW5CHJPXPKTNPVEYQ6/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-29T08:20:03Z","links":{"resolver":"https://pith.science/pith/BXIA6MKWCW5CHJPXPKTNPVEYQ6","bundle":"https://pith.science/pith/BXIA6MKWCW5CHJPXPKTNPVEYQ6/bundle.json","state":"https://pith.science/pith/BXIA6MKWCW5CHJPXPKTNPVEYQ6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BXIA6MKWCW5CHJPXPKTNPVEYQ6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:BXIA6MKWCW5CHJPXPKTNPVEYQ6","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":"785fa4a8934c33c1990712dd3751e0654115ec5611254b62d5fc8947a79e8ff4","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-06-23T15:44:56Z","title_canon_sha256":"5002885badb52fb4bd73353ce093cc8d2144584a62a0eb9e49feae7357161bb9"},"schema_version":"1.0","source":{"id":"1906.09598","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1906.09598","created_at":"2026-05-17T23:41:52Z"},{"alias_kind":"arxiv_version","alias_value":"1906.09598v2","created_at":"2026-05-17T23:41:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1906.09598","created_at":"2026-05-17T23:41:52Z"},{"alias_kind":"pith_short_12","alias_value":"BXIA6MKWCW5C","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_16","alias_value":"BXIA6MKWCW5CHJPX","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_8","alias_value":"BXIA6MKW","created_at":"2026-05-18T12:33:12Z"}],"graph_snapshots":[{"event_id":"sha256:7de9b602a73fa74af8a23dbc7691189e515cf1c12896b72927702d1d3bbe56cd","target":"graph","created_at":"2026-05-17T23:41:52Z","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":"Gallai asked in 1984 if any $k$-critical graph on $n$ vertices contains at least $n$ distinct $(k-1)$-critical subgraphs. The answer is trivial for $k\\leq 3$. Improving a result of Stiebitz, Abbott and Zhou proved in 1995 that for all $k\\geq 4$, such graph contains $\\Omega(n^{1/(k-1)})$ distinct $(k-1)$-critical subgraphs. Since then no progress had been made until very recently, Hare resolved the case $k=4$ by showing that any $4$-critical graph on $n$ vertices contains at least $(8n-29)/3$ odd cycles.\n  In this paper, we mainly focus on 4-critical graphs and develop some novel tools for coun","authors_text":"Jie Ma, Tianchi Yang","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-06-23T15:44:56Z","title":"Counting critical subgraphs in $k$-critical graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1906.09598","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:75a6fc101637a249dc1aae3038c61ba29a3d6f4b089c2a5dbc664d31f1f6b8bc","target":"record","created_at":"2026-05-17T23:41:52Z","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":"785fa4a8934c33c1990712dd3751e0654115ec5611254b62d5fc8947a79e8ff4","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-06-23T15:44:56Z","title_canon_sha256":"5002885badb52fb4bd73353ce093cc8d2144584a62a0eb9e49feae7357161bb9"},"schema_version":"1.0","source":{"id":"1906.09598","kind":"arxiv","version":2}},"canonical_sha256":"0dd00f315615ba23a5f77aa6d7d49887b8ef195f001b606286d99655d1ac1bac","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0dd00f315615ba23a5f77aa6d7d49887b8ef195f001b606286d99655d1ac1bac","first_computed_at":"2026-05-17T23:41:52.778556Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:41:52.778556Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"x5KXYramHhHFfnK345kVMQrEZgv9pitXoB8Hk1FKtJrFPD7tItrsi5Sa851AsTfqnZT90jcBgnGGz8za/8glCA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:41:52.779095Z","signed_message":"canonical_sha256_bytes"},"source_id":"1906.09598","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:75a6fc101637a249dc1aae3038c61ba29a3d6f4b089c2a5dbc664d31f1f6b8bc","sha256:7de9b602a73fa74af8a23dbc7691189e515cf1c12896b72927702d1d3bbe56cd"],"state_sha256":"b342e0c5899c1bf3223cab66ba8b9717795c985862bba850295c5ab46a49c808"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rYAmIFz5r/zkd0VBirAA2GqWeDKlIvyM0DPVO2blpY5jKPBdXJSrlJz9hvHZP/HN5/hMI2KHm1oDFWHbnOLOBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-29T08:20:03.454994Z","bundle_sha256":"13db69ec7e3a20b75cc6e1128b5b765505b2158a24bc91914c2a6b21870148ff"}}