{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:USIJLTFEQD22WXT33FSCEQS5W5","short_pith_number":"pith:USIJLTFE","canonical_record":{"source":{"id":"1612.03298","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-12-10T14:03:23Z","cross_cats_sorted":[],"title_canon_sha256":"a98b14c1bfb88b9a4b26ef9b012e855d3c5b7f1b234a6755fe5e26f935ea67eb","abstract_canon_sha256":"ede240e034478a65c8b3953c9a0b2c956cb0cb018f8c0150e4209b7fd7fe6c39"},"schema_version":"1.0"},"canonical_sha256":"a49095cca480f5ab5e7bd96422425db7492110ee4cc6cb6b130793c19fab9833","source":{"kind":"arxiv","id":"1612.03298","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1612.03298","created_at":"2026-05-18T00:31:51Z"},{"alias_kind":"arxiv_version","alias_value":"1612.03298v1","created_at":"2026-05-18T00:31:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1612.03298","created_at":"2026-05-18T00:31:51Z"},{"alias_kind":"pith_short_12","alias_value":"USIJLTFEQD22","created_at":"2026-05-18T12:30:46Z"},{"alias_kind":"pith_short_16","alias_value":"USIJLTFEQD22WXT3","created_at":"2026-05-18T12:30:46Z"},{"alias_kind":"pith_short_8","alias_value":"USIJLTFE","created_at":"2026-05-18T12:30:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:USIJLTFEQD22WXT33FSCEQS5W5","target":"record","payload":{"canonical_record":{"source":{"id":"1612.03298","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-12-10T14:03:23Z","cross_cats_sorted":[],"title_canon_sha256":"a98b14c1bfb88b9a4b26ef9b012e855d3c5b7f1b234a6755fe5e26f935ea67eb","abstract_canon_sha256":"ede240e034478a65c8b3953c9a0b2c956cb0cb018f8c0150e4209b7fd7fe6c39"},"schema_version":"1.0"},"canonical_sha256":"a49095cca480f5ab5e7bd96422425db7492110ee4cc6cb6b130793c19fab9833","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:31:51.670871Z","signature_b64":"W7k1unEDgeb6wKId32bVJ++XPnhqfjNbv1/yv1QnqQhsrmuAWv1A0NPbLW9acfCiZO9uNloq4D/TCiHoZwZjBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a49095cca480f5ab5e7bd96422425db7492110ee4cc6cb6b130793c19fab9833","last_reissued_at":"2026-05-18T00:31:51.670179Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:31:51.670179Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1612.03298","source_version":1,"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:31:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OBPWn6v+btmQ+BuOJQ9X2WZ9Dn8UDht2o9cI7Plcs25ycj7wIVRqJeBjKQ3u0pRfYoeOL6Bhm2LRaPP1a9swDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-19T08:26:45.167569Z"},"content_sha256":"e20fa0d56ef460fa9775336e1015d05d58aa96b8d3d0e415521a957020320470","schema_version":"1.0","event_id":"sha256:e20fa0d56ef460fa9775336e1015d05d58aa96b8d3d0e415521a957020320470"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:USIJLTFEQD22WXT33FSCEQS5W5","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Polychromatic colorings of complete graphs with respect to 1-,2-factors and Hamiltonian cycles","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Bernard Lidick\\'y, David Offner, John Goldwasser, John Talbot, Maria Axenovich, Michael Young, Ryan Hansen, Ryan R. Martin","submitted_at":"2016-12-10T14:03:23Z","abstract_excerpt":"If G is a graph and H is a set of subgraphs of G, then an edge-coloring of G is called H-polychromatic if every graph from H gets all colors present in G on its edges. The H-polychromatic number of G, denoted poly_H(G), is the largest number of colors in an H-polychromatic coloring. In this paper, poly_H(G) is determined exactly when G is a complete graph and H is the family of all 1-factors. In addition poly_H(G) is found up to an additive constant term when G is a complete graph and H is the family of all 2-factors, or the family of all Hamiltonian cycles."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1612.03298","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"},"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:31:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1F6n/rGCS+odBjsYhtRb4nEOSL6ooMcZ7AIxATPgTj7Rxwd9imfV0yyQRp6b8VjC9TCgcsKG9U0SjzpZR48HAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-19T08:26:45.168261Z"},"content_sha256":"f3e590cacb18d4fbd81b67fb3f053b3cef245bb441b540cade09ec19ac58279f","schema_version":"1.0","event_id":"sha256:f3e590cacb18d4fbd81b67fb3f053b3cef245bb441b540cade09ec19ac58279f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/USIJLTFEQD22WXT33FSCEQS5W5/bundle.json","state_url":"https://pith.science/pith/USIJLTFEQD22WXT33FSCEQS5W5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/USIJLTFEQD22WXT33FSCEQS5W5/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-19T08:26:45Z","links":{"resolver":"https://pith.science/pith/USIJLTFEQD22WXT33FSCEQS5W5","bundle":"https://pith.science/pith/USIJLTFEQD22WXT33FSCEQS5W5/bundle.json","state":"https://pith.science/pith/USIJLTFEQD22WXT33FSCEQS5W5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/USIJLTFEQD22WXT33FSCEQS5W5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:USIJLTFEQD22WXT33FSCEQS5W5","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":"ede240e034478a65c8b3953c9a0b2c956cb0cb018f8c0150e4209b7fd7fe6c39","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-12-10T14:03:23Z","title_canon_sha256":"a98b14c1bfb88b9a4b26ef9b012e855d3c5b7f1b234a6755fe5e26f935ea67eb"},"schema_version":"1.0","source":{"id":"1612.03298","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1612.03298","created_at":"2026-05-18T00:31:51Z"},{"alias_kind":"arxiv_version","alias_value":"1612.03298v1","created_at":"2026-05-18T00:31:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1612.03298","created_at":"2026-05-18T00:31:51Z"},{"alias_kind":"pith_short_12","alias_value":"USIJLTFEQD22","created_at":"2026-05-18T12:30:46Z"},{"alias_kind":"pith_short_16","alias_value":"USIJLTFEQD22WXT3","created_at":"2026-05-18T12:30:46Z"},{"alias_kind":"pith_short_8","alias_value":"USIJLTFE","created_at":"2026-05-18T12:30:46Z"}],"graph_snapshots":[{"event_id":"sha256:f3e590cacb18d4fbd81b67fb3f053b3cef245bb441b540cade09ec19ac58279f","target":"graph","created_at":"2026-05-18T00:31:51Z","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":"If G is a graph and H is a set of subgraphs of G, then an edge-coloring of G is called H-polychromatic if every graph from H gets all colors present in G on its edges. The H-polychromatic number of G, denoted poly_H(G), is the largest number of colors in an H-polychromatic coloring. In this paper, poly_H(G) is determined exactly when G is a complete graph and H is the family of all 1-factors. In addition poly_H(G) is found up to an additive constant term when G is a complete graph and H is the family of all 2-factors, or the family of all Hamiltonian cycles.","authors_text":"Bernard Lidick\\'y, David Offner, John Goldwasser, John Talbot, Maria Axenovich, Michael Young, Ryan Hansen, Ryan R. Martin","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-12-10T14:03:23Z","title":"Polychromatic colorings of complete graphs with respect to 1-,2-factors and Hamiltonian cycles"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1612.03298","kind":"arxiv","version":1},"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:e20fa0d56ef460fa9775336e1015d05d58aa96b8d3d0e415521a957020320470","target":"record","created_at":"2026-05-18T00:31:51Z","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":"ede240e034478a65c8b3953c9a0b2c956cb0cb018f8c0150e4209b7fd7fe6c39","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-12-10T14:03:23Z","title_canon_sha256":"a98b14c1bfb88b9a4b26ef9b012e855d3c5b7f1b234a6755fe5e26f935ea67eb"},"schema_version":"1.0","source":{"id":"1612.03298","kind":"arxiv","version":1}},"canonical_sha256":"a49095cca480f5ab5e7bd96422425db7492110ee4cc6cb6b130793c19fab9833","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a49095cca480f5ab5e7bd96422425db7492110ee4cc6cb6b130793c19fab9833","first_computed_at":"2026-05-18T00:31:51.670179Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:31:51.670179Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"W7k1unEDgeb6wKId32bVJ++XPnhqfjNbv1/yv1QnqQhsrmuAWv1A0NPbLW9acfCiZO9uNloq4D/TCiHoZwZjBA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:31:51.670871Z","signed_message":"canonical_sha256_bytes"},"source_id":"1612.03298","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e20fa0d56ef460fa9775336e1015d05d58aa96b8d3d0e415521a957020320470","sha256:f3e590cacb18d4fbd81b67fb3f053b3cef245bb441b540cade09ec19ac58279f"],"state_sha256":"3946186e82f47bddb3fd4aaacdcbaf15b32b0edbbb0767692e4969fa0db9310e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sxL0SzMppY5bq725PN36x5s0wEUlc+BYK/BLvv57Z1HWys2YKbBMqHaGV3FgTrlN1d8VUhoqXM+A2W3HqMFcBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-19T08:26:45.171437Z","bundle_sha256":"236861215c6edd756d2beab20895c360c5b3067e47185d8cccefa70c9edb0127"}}