{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:QNJEEB5H4VBM7PCBHRS3OQVZML","short_pith_number":"pith:QNJEEB5H","canonical_record":{"source":{"id":"1611.03454","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-11-10T19:19:42Z","cross_cats_sorted":[],"title_canon_sha256":"7a3aa04b9f1b8777c92a6651509cd9674b306c91e54658262b47652c0276d51c","abstract_canon_sha256":"c815676a5f9a647334bab0c585e2c3af28d22e0501c83eca3306f2ec2cd1966b"},"schema_version":"1.0"},"canonical_sha256":"83524207a7e542cfbc413c65b742b962d32f36a63ab1653b7cb425b5968dcedf","source":{"kind":"arxiv","id":"1611.03454","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1611.03454","created_at":"2026-05-18T00:40:40Z"},{"alias_kind":"arxiv_version","alias_value":"1611.03454v3","created_at":"2026-05-18T00:40:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.03454","created_at":"2026-05-18T00:40:40Z"},{"alias_kind":"pith_short_12","alias_value":"QNJEEB5H4VBM","created_at":"2026-05-18T12:30:39Z"},{"alias_kind":"pith_short_16","alias_value":"QNJEEB5H4VBM7PCB","created_at":"2026-05-18T12:30:39Z"},{"alias_kind":"pith_short_8","alias_value":"QNJEEB5H","created_at":"2026-05-18T12:30:39Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:QNJEEB5H4VBM7PCBHRS3OQVZML","target":"record","payload":{"canonical_record":{"source":{"id":"1611.03454","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-11-10T19:19:42Z","cross_cats_sorted":[],"title_canon_sha256":"7a3aa04b9f1b8777c92a6651509cd9674b306c91e54658262b47652c0276d51c","abstract_canon_sha256":"c815676a5f9a647334bab0c585e2c3af28d22e0501c83eca3306f2ec2cd1966b"},"schema_version":"1.0"},"canonical_sha256":"83524207a7e542cfbc413c65b742b962d32f36a63ab1653b7cb425b5968dcedf","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:40:40.880472Z","signature_b64":"7LgtDHR02PEMdAJS9F2jbaUUS7o+P44JU+L6BB8FjaDvRVtOifRUj2w6siOa3ZAQ0oEerU4YDgliAVBRod5QCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"83524207a7e542cfbc413c65b742b962d32f36a63ab1653b7cb425b5968dcedf","last_reissued_at":"2026-05-18T00:40:40.879626Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:40:40.879626Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1611.03454","source_version":3,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:40:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rYEQdG5dJ5pZwe3j1lMQ/4lvZ6/+UerxjcyIo/91Xn/kzfydpn1DpRHRFF+BZYWOVrInnSs8+ly1Rm/YyvtzAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T02:40:29.479782Z"},"content_sha256":"1b257e3e56e41b8e6a0f32cd55c0fe2d20317c719e546688d5f00bbeac17a265","schema_version":"1.0","event_id":"sha256:1b257e3e56e41b8e6a0f32cd55c0fe2d20317c719e546688d5f00bbeac17a265"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:QNJEEB5H4VBM7PCBHRS3OQVZML","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Injective choosability of subcubic planar graphs with girth 6","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Bernard Lidick\\'y, Boris Brimkov, Jennifer Edmond, Kacy Messerschmidt, Robert Lazar, Shanise Walker","submitted_at":"2016-11-10T19:19:42Z","abstract_excerpt":"An injective coloring of a graph $G$ is an assignment of colors to the vertices of $G$ so that any two vertices with a common neighbor have distinct colors. A graph $G$ is injectively $k$-choosable if for any list assignment $L$, where $|L(v)| \\geq k$ for all $v \\in V(G)$, $G$ has an injective $L$-coloring. Injective colorings have applications in the theory of error-correcting codes and are closely related to other notions of colorability. In this paper, we show that subcubic planar graphs with girth at least 6 are injectively 5-choosable. This strengthens a result of Lu\\v{z}ar, \\v{S}krekovsk"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.03454","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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:40:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7fCHawrqBr6oDNl1sjabMQnHo9jNjxjt8JCcZ7hJkuqRa9PcnpXfNoZUUqo+03gGDYNAaNlpveA4OQRHdmAwBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T02:40:29.480455Z"},"content_sha256":"08195944ebf20e8f4018c2e6b899482f62dd2ba227bca1d6f67abcc276a138b3","schema_version":"1.0","event_id":"sha256:08195944ebf20e8f4018c2e6b899482f62dd2ba227bca1d6f67abcc276a138b3"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QNJEEB5H4VBM7PCBHRS3OQVZML/bundle.json","state_url":"https://pith.science/pith/QNJEEB5H4VBM7PCBHRS3OQVZML/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QNJEEB5H4VBM7PCBHRS3OQVZML/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-30T02:40:29Z","links":{"resolver":"https://pith.science/pith/QNJEEB5H4VBM7PCBHRS3OQVZML","bundle":"https://pith.science/pith/QNJEEB5H4VBM7PCBHRS3OQVZML/bundle.json","state":"https://pith.science/pith/QNJEEB5H4VBM7PCBHRS3OQVZML/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QNJEEB5H4VBM7PCBHRS3OQVZML/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:QNJEEB5H4VBM7PCBHRS3OQVZML","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"c815676a5f9a647334bab0c585e2c3af28d22e0501c83eca3306f2ec2cd1966b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-11-10T19:19:42Z","title_canon_sha256":"7a3aa04b9f1b8777c92a6651509cd9674b306c91e54658262b47652c0276d51c"},"schema_version":"1.0","source":{"id":"1611.03454","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1611.03454","created_at":"2026-05-18T00:40:40Z"},{"alias_kind":"arxiv_version","alias_value":"1611.03454v3","created_at":"2026-05-18T00:40:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.03454","created_at":"2026-05-18T00:40:40Z"},{"alias_kind":"pith_short_12","alias_value":"QNJEEB5H4VBM","created_at":"2026-05-18T12:30:39Z"},{"alias_kind":"pith_short_16","alias_value":"QNJEEB5H4VBM7PCB","created_at":"2026-05-18T12:30:39Z"},{"alias_kind":"pith_short_8","alias_value":"QNJEEB5H","created_at":"2026-05-18T12:30:39Z"}],"graph_snapshots":[{"event_id":"sha256:08195944ebf20e8f4018c2e6b899482f62dd2ba227bca1d6f67abcc276a138b3","target":"graph","created_at":"2026-05-18T00:40:40Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"An injective coloring of a graph $G$ is an assignment of colors to the vertices of $G$ so that any two vertices with a common neighbor have distinct colors. A graph $G$ is injectively $k$-choosable if for any list assignment $L$, where $|L(v)| \\geq k$ for all $v \\in V(G)$, $G$ has an injective $L$-coloring. Injective colorings have applications in the theory of error-correcting codes and are closely related to other notions of colorability. In this paper, we show that subcubic planar graphs with girth at least 6 are injectively 5-choosable. This strengthens a result of Lu\\v{z}ar, \\v{S}krekovsk","authors_text":"Bernard Lidick\\'y, Boris Brimkov, Jennifer Edmond, Kacy Messerschmidt, Robert Lazar, Shanise Walker","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-11-10T19:19:42Z","title":"Injective choosability of subcubic planar graphs with girth 6"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.03454","kind":"arxiv","version":3},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:1b257e3e56e41b8e6a0f32cd55c0fe2d20317c719e546688d5f00bbeac17a265","target":"record","created_at":"2026-05-18T00:40:40Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"c815676a5f9a647334bab0c585e2c3af28d22e0501c83eca3306f2ec2cd1966b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-11-10T19:19:42Z","title_canon_sha256":"7a3aa04b9f1b8777c92a6651509cd9674b306c91e54658262b47652c0276d51c"},"schema_version":"1.0","source":{"id":"1611.03454","kind":"arxiv","version":3}},"canonical_sha256":"83524207a7e542cfbc413c65b742b962d32f36a63ab1653b7cb425b5968dcedf","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"83524207a7e542cfbc413c65b742b962d32f36a63ab1653b7cb425b5968dcedf","first_computed_at":"2026-05-18T00:40:40.879626Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:40:40.879626Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"7LgtDHR02PEMdAJS9F2jbaUUS7o+P44JU+L6BB8FjaDvRVtOifRUj2w6siOa3ZAQ0oEerU4YDgliAVBRod5QCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:40:40.880472Z","signed_message":"canonical_sha256_bytes"},"source_id":"1611.03454","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1b257e3e56e41b8e6a0f32cd55c0fe2d20317c719e546688d5f00bbeac17a265","sha256:08195944ebf20e8f4018c2e6b899482f62dd2ba227bca1d6f67abcc276a138b3"],"state_sha256":"7865cff7fe6f55570090cd374911d3dadb273ce163f95d3e9ad038722ca83df6"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cY2cnp1wVhM0s/GbFME3NV4zqUoF0buUMv3TGvzjJlUJNxwBj6AAveICjj2hYE10ZQSXxbzJZ/cMdRy0tPQPAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T02:40:29.484986Z","bundle_sha256":"385647e4a212d3152a7410a1560b51d5f7bc3a2442d2db158fa5cf44187456e2"}}