{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:C3X3BGJDQCZUU76ZDQWE6G4CC2","short_pith_number":"pith:C3X3BGJD","schema_version":"1.0","canonical_sha256":"16efb0992380b34a7fd91c2c4f1b8216944494bbddf1ef3490d9b2ea543085fd","source":{"kind":"arxiv","id":"1503.04680","version":1},"attestation_state":"computed","paper":{"title":"Low Degree Nullstellensatz Certificates for 3-Colorability","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Benjamin Lowenstein, Bo Li, Mohamed Omar","submitted_at":"2015-03-16T15:15:49Z","abstract_excerpt":"In a seminal paper, De Loera et. al introduce the algorithm NulLA (Nullstellensatz Linear Algebra) and use it to measure the difficulty of determining if a graph is not 3-colorable. The crux of this relies on a correspondence between 3-colorings of a graph and solutions to a certain system of polynomial equations over a field $\\mathbb{k}$. In this article, we give a new direct combinatorial characterization of graphs that can be determined to be non-3-colorable in the first iteration of this algorithm when $\\mathbb{k}=GF(2)$. This greatly simplifies the work of De Loera et. al, as we express t"},"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":"1503.04680","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-03-16T15:15:49Z","cross_cats_sorted":[],"title_canon_sha256":"8de9203fbaeda9d174021cb4dcd7e3855e7e7c9ca524ac284df2f97e8eb88db9","abstract_canon_sha256":"55aa48e7a9b4e4337bca28a915a6e91e5dd6d8d38c9d80f310a7295f7b8c0477"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:23:24.295855Z","signature_b64":"0ubWVxw0SVPpj6deP/n2E1hnNldaDn/CEkk9e6q+MrXqd8LjaOqXuC8h6QinnHQlT5ZZiXhnAepGflXpea4sBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"16efb0992380b34a7fd91c2c4f1b8216944494bbddf1ef3490d9b2ea543085fd","last_reissued_at":"2026-05-18T02:23:24.295088Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:23:24.295088Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Low Degree Nullstellensatz Certificates for 3-Colorability","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Benjamin Lowenstein, Bo Li, Mohamed Omar","submitted_at":"2015-03-16T15:15:49Z","abstract_excerpt":"In a seminal paper, De Loera et. al introduce the algorithm NulLA (Nullstellensatz Linear Algebra) and use it to measure the difficulty of determining if a graph is not 3-colorable. The crux of this relies on a correspondence between 3-colorings of a graph and solutions to a certain system of polynomial equations over a field $\\mathbb{k}$. In this article, we give a new direct combinatorial characterization of graphs that can be determined to be non-3-colorable in the first iteration of this algorithm when $\\mathbb{k}=GF(2)$. This greatly simplifies the work of De Loera et. al, as we express t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1503.04680","kind":"arxiv","version":1},"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":"1503.04680","created_at":"2026-05-18T02:23:24.295205+00:00"},{"alias_kind":"arxiv_version","alias_value":"1503.04680v1","created_at":"2026-05-18T02:23:24.295205+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1503.04680","created_at":"2026-05-18T02:23:24.295205+00:00"},{"alias_kind":"pith_short_12","alias_value":"C3X3BGJDQCZU","created_at":"2026-05-18T12:29:14.074870+00:00"},{"alias_kind":"pith_short_16","alias_value":"C3X3BGJDQCZUU76Z","created_at":"2026-05-18T12:29:14.074870+00:00"},{"alias_kind":"pith_short_8","alias_value":"C3X3BGJD","created_at":"2026-05-18T12:29:14.074870+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/C3X3BGJDQCZUU76ZDQWE6G4CC2","json":"https://pith.science/pith/C3X3BGJDQCZUU76ZDQWE6G4CC2.json","graph_json":"https://pith.science/api/pith-number/C3X3BGJDQCZUU76ZDQWE6G4CC2/graph.json","events_json":"https://pith.science/api/pith-number/C3X3BGJDQCZUU76ZDQWE6G4CC2/events.json","paper":"https://pith.science/paper/C3X3BGJD"},"agent_actions":{"view_html":"https://pith.science/pith/C3X3BGJDQCZUU76ZDQWE6G4CC2","download_json":"https://pith.science/pith/C3X3BGJDQCZUU76ZDQWE6G4CC2.json","view_paper":"https://pith.science/paper/C3X3BGJD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1503.04680&json=true","fetch_graph":"https://pith.science/api/pith-number/C3X3BGJDQCZUU76ZDQWE6G4CC2/graph.json","fetch_events":"https://pith.science/api/pith-number/C3X3BGJDQCZUU76ZDQWE6G4CC2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/C3X3BGJDQCZUU76ZDQWE6G4CC2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/C3X3BGJDQCZUU76ZDQWE6G4CC2/action/storage_attestation","attest_author":"https://pith.science/pith/C3X3BGJDQCZUU76ZDQWE6G4CC2/action/author_attestation","sign_citation":"https://pith.science/pith/C3X3BGJDQCZUU76ZDQWE6G4CC2/action/citation_signature","submit_replication":"https://pith.science/pith/C3X3BGJDQCZUU76ZDQWE6G4CC2/action/replication_record"}},"created_at":"2026-05-18T02:23:24.295205+00:00","updated_at":"2026-05-18T02:23:24.295205+00:00"}