{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:MPEYCOITBGDOCDRXUUE4WO4XTE","short_pith_number":"pith:MPEYCOIT","schema_version":"1.0","canonical_sha256":"63c98139130986e10e37a509cb3b97990128e8376737585453fb1f498032c5d0","source":{"kind":"arxiv","id":"1604.01282","version":1},"attestation_state":"computed","paper":{"title":"New Bounds for Facial Nonrepetitive Colouring","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Lucas Rioux-Maldague, Pat Morin, Prosenjit Bose, Vida Dujmovi\\'c","submitted_at":"2016-04-05T14:55:17Z","abstract_excerpt":"We prove that the facial nonrepetitive chromatic number of any outerplanar graph is at most 11 and of any planar graph is at most 22."},"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":"1604.01282","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-04-05T14:55:17Z","cross_cats_sorted":[],"title_canon_sha256":"b3dbe285decb265f6012439b83416c409ffbe1d2f2cb5715891ac68a4b32976f","abstract_canon_sha256":"1bd2c88285883f4be2422e9dcc1f392f06cfaa7f47cf62e3598d820fec4cf123"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:17:38.637196Z","signature_b64":"IOxeH7siazwWsGKSGlcDBAg0orDBoI6K8shJp4VcykbOpSNK6y9neM/Ik/2qjY8U4wOF1cBO5SKUibdJ71wIBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"63c98139130986e10e37a509cb3b97990128e8376737585453fb1f498032c5d0","last_reissued_at":"2026-05-18T01:17:38.636529Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:17:38.636529Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"New Bounds for Facial Nonrepetitive Colouring","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Lucas Rioux-Maldague, Pat Morin, Prosenjit Bose, Vida Dujmovi\\'c","submitted_at":"2016-04-05T14:55:17Z","abstract_excerpt":"We prove that the facial nonrepetitive chromatic number of any outerplanar graph is at most 11 and of any planar graph is at most 22."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1604.01282","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":"1604.01282","created_at":"2026-05-18T01:17:38.636631+00:00"},{"alias_kind":"arxiv_version","alias_value":"1604.01282v1","created_at":"2026-05-18T01:17:38.636631+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.01282","created_at":"2026-05-18T01:17:38.636631+00:00"},{"alias_kind":"pith_short_12","alias_value":"MPEYCOITBGDO","created_at":"2026-05-18T12:30:32.724797+00:00"},{"alias_kind":"pith_short_16","alias_value":"MPEYCOITBGDOCDRX","created_at":"2026-05-18T12:30:32.724797+00:00"},{"alias_kind":"pith_short_8","alias_value":"MPEYCOIT","created_at":"2026-05-18T12:30:32.724797+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/MPEYCOITBGDOCDRXUUE4WO4XTE","json":"https://pith.science/pith/MPEYCOITBGDOCDRXUUE4WO4XTE.json","graph_json":"https://pith.science/api/pith-number/MPEYCOITBGDOCDRXUUE4WO4XTE/graph.json","events_json":"https://pith.science/api/pith-number/MPEYCOITBGDOCDRXUUE4WO4XTE/events.json","paper":"https://pith.science/paper/MPEYCOIT"},"agent_actions":{"view_html":"https://pith.science/pith/MPEYCOITBGDOCDRXUUE4WO4XTE","download_json":"https://pith.science/pith/MPEYCOITBGDOCDRXUUE4WO4XTE.json","view_paper":"https://pith.science/paper/MPEYCOIT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1604.01282&json=true","fetch_graph":"https://pith.science/api/pith-number/MPEYCOITBGDOCDRXUUE4WO4XTE/graph.json","fetch_events":"https://pith.science/api/pith-number/MPEYCOITBGDOCDRXUUE4WO4XTE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MPEYCOITBGDOCDRXUUE4WO4XTE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MPEYCOITBGDOCDRXUUE4WO4XTE/action/storage_attestation","attest_author":"https://pith.science/pith/MPEYCOITBGDOCDRXUUE4WO4XTE/action/author_attestation","sign_citation":"https://pith.science/pith/MPEYCOITBGDOCDRXUUE4WO4XTE/action/citation_signature","submit_replication":"https://pith.science/pith/MPEYCOITBGDOCDRXUUE4WO4XTE/action/replication_record"}},"created_at":"2026-05-18T01:17:38.636631+00:00","updated_at":"2026-05-18T01:17:38.636631+00:00"}