{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:6HCDJ74IDEZSD2YRY7XBF6TV5J","short_pith_number":"pith:6HCDJ74I","schema_version":"1.0","canonical_sha256":"f1c434ff88193321eb11c7ee12fa75ea7b4594a5206058141353dc4b322aac8d","source":{"kind":"arxiv","id":"1912.03396","version":1},"attestation_state":"computed","paper":{"title":"Laurent polynomials of planar graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Mariusz Zaj\\k{a}c","submitted_at":"2019-12-06T23:57:38Z","abstract_excerpt":"By using Laurent graph polynomials instead of the usual ones, i.e. by allowing negative powers of the variables, we simplify an existing method of determining the Alon-Tarsi numbers of planar graphs."},"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":"1912.03396","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-12-06T23:57:38Z","cross_cats_sorted":[],"title_canon_sha256":"4aa9aed065240650b477c5953e92c2349d531eabea41daca140d3d6f9bf6aee9","abstract_canon_sha256":"616e590a3f220365ad71dc3dde23af12746fc24c1cfc367864e50e4c7576a4e9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:24:45.046918Z","signature_b64":"EQbKuLoiNUfMfJwEjZg+mqgeadnl8meXbzJAaoSTuDMhSulKqSY+NDU+EB+OtDkrfvGLAYSHSuaB1vacgiH/Dw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f1c434ff88193321eb11c7ee12fa75ea7b4594a5206058141353dc4b322aac8d","last_reissued_at":"2026-07-05T00:24:45.046509Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:24:45.046509Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Laurent polynomials of planar graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Mariusz Zaj\\k{a}c","submitted_at":"2019-12-06T23:57:38Z","abstract_excerpt":"By using Laurent graph polynomials instead of the usual ones, i.e. by allowing negative powers of the variables, we simplify an existing method of determining the Alon-Tarsi numbers of planar graphs."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1912.03396","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/1912.03396/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":"1912.03396","created_at":"2026-07-05T00:24:45.046574+00:00"},{"alias_kind":"arxiv_version","alias_value":"1912.03396v1","created_at":"2026-07-05T00:24:45.046574+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1912.03396","created_at":"2026-07-05T00:24:45.046574+00:00"},{"alias_kind":"pith_short_12","alias_value":"6HCDJ74IDEZS","created_at":"2026-07-05T00:24:45.046574+00:00"},{"alias_kind":"pith_short_16","alias_value":"6HCDJ74IDEZSD2YR","created_at":"2026-07-05T00:24:45.046574+00:00"},{"alias_kind":"pith_short_8","alias_value":"6HCDJ74I","created_at":"2026-07-05T00:24:45.046574+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/6HCDJ74IDEZSD2YRY7XBF6TV5J","json":"https://pith.science/pith/6HCDJ74IDEZSD2YRY7XBF6TV5J.json","graph_json":"https://pith.science/api/pith-number/6HCDJ74IDEZSD2YRY7XBF6TV5J/graph.json","events_json":"https://pith.science/api/pith-number/6HCDJ74IDEZSD2YRY7XBF6TV5J/events.json","paper":"https://pith.science/paper/6HCDJ74I"},"agent_actions":{"view_html":"https://pith.science/pith/6HCDJ74IDEZSD2YRY7XBF6TV5J","download_json":"https://pith.science/pith/6HCDJ74IDEZSD2YRY7XBF6TV5J.json","view_paper":"https://pith.science/paper/6HCDJ74I","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1912.03396&json=true","fetch_graph":"https://pith.science/api/pith-number/6HCDJ74IDEZSD2YRY7XBF6TV5J/graph.json","fetch_events":"https://pith.science/api/pith-number/6HCDJ74IDEZSD2YRY7XBF6TV5J/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6HCDJ74IDEZSD2YRY7XBF6TV5J/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6HCDJ74IDEZSD2YRY7XBF6TV5J/action/storage_attestation","attest_author":"https://pith.science/pith/6HCDJ74IDEZSD2YRY7XBF6TV5J/action/author_attestation","sign_citation":"https://pith.science/pith/6HCDJ74IDEZSD2YRY7XBF6TV5J/action/citation_signature","submit_replication":"https://pith.science/pith/6HCDJ74IDEZSD2YRY7XBF6TV5J/action/replication_record"}},"created_at":"2026-07-05T00:24:45.046574+00:00","updated_at":"2026-07-05T00:24:45.046574+00:00"}