{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:ZCGR3RTBOEBZQLCRA7V6IA7F36","short_pith_number":"pith:ZCGR3RTB","schema_version":"1.0","canonical_sha256":"c88d1dc6617103982c5107ebe403e5df91c446b253beb12379fd517db55142f9","source":{"kind":"arxiv","id":"1301.6983","version":3},"attestation_state":"computed","paper":{"title":"Replication in critical graphs and the persistence of monomial ideals","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Mat\\v{e}j Stehl\\'ik, Riste \\v{S}krekovski, Tom\\'a\\v{s} Kaiser","submitted_at":"2013-01-29T16:52:18Z","abstract_excerpt":"Motivated by questions about square-free monomial ideals in polynomial rings, in 2010 Francisco et al. conjectured that for every positive integer k and every k-critical (i.e., critically k-chromatic) graph, there is a set of vertices whose replication produces a (k+1)-critical graph. (The replication of a set W of vertices of a graph is the operation that adds a copy of each vertex w in W, one at a time, and connects it to w and all its neighbours.)\n  We disprove the conjecture by providing an infinite family of counterexamples. Furthermore, the smallest member of the family answers a questio"},"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":"1301.6983","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-01-29T16:52:18Z","cross_cats_sorted":[],"title_canon_sha256":"e2554ab743c54439903b1f6fcd0f235a8c1e644efb49efdde29eebc489c8365d","abstract_canon_sha256":"3532a5e9873abefd6804748c165216e3ad5333fc9be1b95b5db75c4c81dbf48c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:02:21.180554Z","signature_b64":"SENp/1ASlTuH2LIF2+xxIOVItP5Fg3kylQkMijpaYHSpLx3NXO+q8Ajt2YwzOZ4O676UfxxDuJNWc+NrcsZlCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c88d1dc6617103982c5107ebe403e5df91c446b253beb12379fd517db55142f9","last_reissued_at":"2026-05-18T03:02:21.179754Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:02:21.179754Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Replication in critical graphs and the persistence of monomial ideals","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Mat\\v{e}j Stehl\\'ik, Riste \\v{S}krekovski, Tom\\'a\\v{s} Kaiser","submitted_at":"2013-01-29T16:52:18Z","abstract_excerpt":"Motivated by questions about square-free monomial ideals in polynomial rings, in 2010 Francisco et al. conjectured that for every positive integer k and every k-critical (i.e., critically k-chromatic) graph, there is a set of vertices whose replication produces a (k+1)-critical graph. (The replication of a set W of vertices of a graph is the operation that adds a copy of each vertex w in W, one at a time, and connects it to w and all its neighbours.)\n  We disprove the conjecture by providing an infinite family of counterexamples. Furthermore, the smallest member of the family answers a questio"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1301.6983","kind":"arxiv","version":3},"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":"1301.6983","created_at":"2026-05-18T03:02:21.179868+00:00"},{"alias_kind":"arxiv_version","alias_value":"1301.6983v3","created_at":"2026-05-18T03:02:21.179868+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1301.6983","created_at":"2026-05-18T03:02:21.179868+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZCGR3RTBOEBZ","created_at":"2026-05-18T12:28:09.283467+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZCGR3RTBOEBZQLCR","created_at":"2026-05-18T12:28:09.283467+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZCGR3RTB","created_at":"2026-05-18T12:28:09.283467+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/ZCGR3RTBOEBZQLCRA7V6IA7F36","json":"https://pith.science/pith/ZCGR3RTBOEBZQLCRA7V6IA7F36.json","graph_json":"https://pith.science/api/pith-number/ZCGR3RTBOEBZQLCRA7V6IA7F36/graph.json","events_json":"https://pith.science/api/pith-number/ZCGR3RTBOEBZQLCRA7V6IA7F36/events.json","paper":"https://pith.science/paper/ZCGR3RTB"},"agent_actions":{"view_html":"https://pith.science/pith/ZCGR3RTBOEBZQLCRA7V6IA7F36","download_json":"https://pith.science/pith/ZCGR3RTBOEBZQLCRA7V6IA7F36.json","view_paper":"https://pith.science/paper/ZCGR3RTB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1301.6983&json=true","fetch_graph":"https://pith.science/api/pith-number/ZCGR3RTBOEBZQLCRA7V6IA7F36/graph.json","fetch_events":"https://pith.science/api/pith-number/ZCGR3RTBOEBZQLCRA7V6IA7F36/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZCGR3RTBOEBZQLCRA7V6IA7F36/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZCGR3RTBOEBZQLCRA7V6IA7F36/action/storage_attestation","attest_author":"https://pith.science/pith/ZCGR3RTBOEBZQLCRA7V6IA7F36/action/author_attestation","sign_citation":"https://pith.science/pith/ZCGR3RTBOEBZQLCRA7V6IA7F36/action/citation_signature","submit_replication":"https://pith.science/pith/ZCGR3RTBOEBZQLCRA7V6IA7F36/action/replication_record"}},"created_at":"2026-05-18T03:02:21.179868+00:00","updated_at":"2026-05-18T03:02:21.179868+00:00"}