{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:BXIA6MKWCW5CHJPXPKTNPVEYQ6","short_pith_number":"pith:BXIA6MKW","schema_version":"1.0","canonical_sha256":"0dd00f315615ba23a5f77aa6d7d49887b8ef195f001b606286d99655d1ac1bac","source":{"kind":"arxiv","id":"1906.09598","version":2},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1906.09598","created_at":"2026-05-17T23:41:52.778624+00:00"},{"alias_kind":"arxiv_version","alias_value":"1906.09598v2","created_at":"2026-05-17T23:41:52.778624+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1906.09598","created_at":"2026-05-17T23:41:52.778624+00:00"},{"alias_kind":"pith_short_12","alias_value":"BXIA6MKWCW5C","created_at":"2026-05-18T12:33:12.712433+00:00"},{"alias_kind":"pith_short_16","alias_value":"BXIA6MKWCW5CHJPX","created_at":"2026-05-18T12:33:12.712433+00:00"},{"alias_kind":"pith_short_8","alias_value":"BXIA6MKW","created_at":"2026-05-18T12:33:12.712433+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/BXIA6MKWCW5CHJPXPKTNPVEYQ6","json":"https://pith.science/pith/BXIA6MKWCW5CHJPXPKTNPVEYQ6.json","graph_json":"https://pith.science/api/pith-number/BXIA6MKWCW5CHJPXPKTNPVEYQ6/graph.json","events_json":"https://pith.science/api/pith-number/BXIA6MKWCW5CHJPXPKTNPVEYQ6/events.json","paper":"https://pith.science/paper/BXIA6MKW"},"agent_actions":{"view_html":"https://pith.science/pith/BXIA6MKWCW5CHJPXPKTNPVEYQ6","download_json":"https://pith.science/pith/BXIA6MKWCW5CHJPXPKTNPVEYQ6.json","view_paper":"https://pith.science/paper/BXIA6MKW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1906.09598&json=true","fetch_graph":"https://pith.science/api/pith-number/BXIA6MKWCW5CHJPXPKTNPVEYQ6/graph.json","fetch_events":"https://pith.science/api/pith-number/BXIA6MKWCW5CHJPXPKTNPVEYQ6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BXIA6MKWCW5CHJPXPKTNPVEYQ6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BXIA6MKWCW5CHJPXPKTNPVEYQ6/action/storage_attestation","attest_author":"https://pith.science/pith/BXIA6MKWCW5CHJPXPKTNPVEYQ6/action/author_attestation","sign_citation":"https://pith.science/pith/BXIA6MKWCW5CHJPXPKTNPVEYQ6/action/citation_signature","submit_replication":"https://pith.science/pith/BXIA6MKWCW5CHJPXPKTNPVEYQ6/action/replication_record"}},"created_at":"2026-05-17T23:41:52.778624+00:00","updated_at":"2026-05-17T23:41:52.778624+00:00"}