{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:EWHLHK2BHCDM2COKCSDNML4JQX","short_pith_number":"pith:EWHLHK2B","schema_version":"1.0","canonical_sha256":"258eb3ab413886cd09ca1486d62f8985c0c318d8c2a60c27461a1d31a8a62c6e","source":{"kind":"arxiv","id":"2210.13618","version":1},"attestation_state":"computed","paper":{"title":"Square of Planar Graphs of Max Degree Four without Five Cycles","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Eric Culver, Stephen G. Hartke","submitted_at":"2022-10-24T21:34:48Z","abstract_excerpt":"We show that the choosability of the square of planar graphs of max degree 4 without five cycles is at most 12.\n  Keywords: planar graph, choosability\n  AMS Mathematics Subject Classification: 05C15"},"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":"2210.13618","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"math.CO","submitted_at":"2022-10-24T21:34:48Z","cross_cats_sorted":[],"title_canon_sha256":"2f5df17ada01799ee10cbfa97b568cade24a937d30d8f17d6c03c593818afae2","abstract_canon_sha256":"ba54a599b6430be208b2a0cd9afdd4056200d59f2e2cbf17f9b3dcd2991ae5f3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:10:20.023745Z","signature_b64":"eqGqWfAD6yjRQCpNSmpgj76YMZb136uIJdu3DDvl6X6eRL90Lax7cPq1iwRtxPSopNOu0vl7yJ+W9PunP+cdBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"258eb3ab413886cd09ca1486d62f8985c0c318d8c2a60c27461a1d31a8a62c6e","last_reissued_at":"2026-07-05T05:10:20.023369Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:10:20.023369Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Square of Planar Graphs of Max Degree Four without Five Cycles","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Eric Culver, Stephen G. Hartke","submitted_at":"2022-10-24T21:34:48Z","abstract_excerpt":"We show that the choosability of the square of planar graphs of max degree 4 without five cycles is at most 12.\n  Keywords: planar graph, choosability\n  AMS Mathematics Subject Classification: 05C15"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2210.13618","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2210.13618/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2210.13618","created_at":"2026-07-05T05:10:20.023431+00:00"},{"alias_kind":"arxiv_version","alias_value":"2210.13618v1","created_at":"2026-07-05T05:10:20.023431+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2210.13618","created_at":"2026-07-05T05:10:20.023431+00:00"},{"alias_kind":"pith_short_12","alias_value":"EWHLHK2BHCDM","created_at":"2026-07-05T05:10:20.023431+00:00"},{"alias_kind":"pith_short_16","alias_value":"EWHLHK2BHCDM2COK","created_at":"2026-07-05T05:10:20.023431+00:00"},{"alias_kind":"pith_short_8","alias_value":"EWHLHK2B","created_at":"2026-07-05T05:10:20.023431+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/EWHLHK2BHCDM2COKCSDNML4JQX","json":"https://pith.science/pith/EWHLHK2BHCDM2COKCSDNML4JQX.json","graph_json":"https://pith.science/api/pith-number/EWHLHK2BHCDM2COKCSDNML4JQX/graph.json","events_json":"https://pith.science/api/pith-number/EWHLHK2BHCDM2COKCSDNML4JQX/events.json","paper":"https://pith.science/paper/EWHLHK2B"},"agent_actions":{"view_html":"https://pith.science/pith/EWHLHK2BHCDM2COKCSDNML4JQX","download_json":"https://pith.science/pith/EWHLHK2BHCDM2COKCSDNML4JQX.json","view_paper":"https://pith.science/paper/EWHLHK2B","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2210.13618&json=true","fetch_graph":"https://pith.science/api/pith-number/EWHLHK2BHCDM2COKCSDNML4JQX/graph.json","fetch_events":"https://pith.science/api/pith-number/EWHLHK2BHCDM2COKCSDNML4JQX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EWHLHK2BHCDM2COKCSDNML4JQX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EWHLHK2BHCDM2COKCSDNML4JQX/action/storage_attestation","attest_author":"https://pith.science/pith/EWHLHK2BHCDM2COKCSDNML4JQX/action/author_attestation","sign_citation":"https://pith.science/pith/EWHLHK2BHCDM2COKCSDNML4JQX/action/citation_signature","submit_replication":"https://pith.science/pith/EWHLHK2BHCDM2COKCSDNML4JQX/action/replication_record"}},"created_at":"2026-07-05T05:10:20.023431+00:00","updated_at":"2026-07-05T05:10:20.023431+00:00"}