{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:VU32BGKR2DG3HQ5C6RC77YWWNP","short_pith_number":"pith:VU32BGKR","canonical_record":{"source":{"id":"1605.06172","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-05-19T23:30:41Z","cross_cats_sorted":[],"title_canon_sha256":"82ba325c4d8b8941823bf0a30fe70ae46107d91236e6411c4d946ab71c00c940","abstract_canon_sha256":"3d15d5701be1219968d36844ebf16d3429d67db39ed92b9e11757f2a1e84131c"},"schema_version":"1.0"},"canonical_sha256":"ad37a09951d0cdb3c3a2f445ffe2d66be5b259ec342539ba5ee7ef7d696a4f2b","source":{"kind":"arxiv","id":"1605.06172","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1605.06172","created_at":"2026-05-18T01:14:19Z"},{"alias_kind":"arxiv_version","alias_value":"1605.06172v1","created_at":"2026-05-18T01:14:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.06172","created_at":"2026-05-18T01:14:19Z"},{"alias_kind":"pith_short_12","alias_value":"VU32BGKR2DG3","created_at":"2026-05-18T12:30:48Z"},{"alias_kind":"pith_short_16","alias_value":"VU32BGKR2DG3HQ5C","created_at":"2026-05-18T12:30:48Z"},{"alias_kind":"pith_short_8","alias_value":"VU32BGKR","created_at":"2026-05-18T12:30:48Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:VU32BGKR2DG3HQ5C6RC77YWWNP","target":"record","payload":{"canonical_record":{"source":{"id":"1605.06172","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-05-19T23:30:41Z","cross_cats_sorted":[],"title_canon_sha256":"82ba325c4d8b8941823bf0a30fe70ae46107d91236e6411c4d946ab71c00c940","abstract_canon_sha256":"3d15d5701be1219968d36844ebf16d3429d67db39ed92b9e11757f2a1e84131c"},"schema_version":"1.0"},"canonical_sha256":"ad37a09951d0cdb3c3a2f445ffe2d66be5b259ec342539ba5ee7ef7d696a4f2b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:14:19.769255Z","signature_b64":"quQdUMcnkXTrMz6V8T2KEKXBsGSct9lVUDdtnJE4qUoXA/aV6nm/y56CtS6N1BPWdVk8jAuAMbb6FqhwdF1iCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ad37a09951d0cdb3c3a2f445ffe2d66be5b259ec342539ba5ee7ef7d696a4f2b","last_reissued_at":"2026-05-18T01:14:19.768587Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:14:19.768587Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1605.06172","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-18T01:14:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QPFwdJWd3ib6wwh7B52gd3a1QvLLP1fQQvhygYeg7wWhqMwmv7INKNEjH4H6lrVfVBYydrJX8hORnrzCqY5ZBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T20:42:03.352203Z"},"content_sha256":"6dcefc2fe34234d1c07d87cdc1e1b5548030f7bf513b10d6e9fbf08b523504b3","schema_version":"1.0","event_id":"sha256:6dcefc2fe34234d1c07d87cdc1e1b5548030f7bf513b10d6e9fbf08b523504b3"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:VU32BGKR2DG3HQ5C6RC77YWWNP","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Avoiding rainbow induced subgraphs in vertex-colorings","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Maria Axenovich, Ryan Martin","submitted_at":"2016-05-19T23:30:41Z","abstract_excerpt":"For a fixed graph $H$ on $k$ vertices, and a graph $G$ on at least $k$ vertices, we write $G\\rightarrow H$ if in any vertex-coloring of $G$ with $k$ colors, there is an induced subgraph isomorphic to $H$ whose vertices have distinct colors. In other words, if $G\\rightarrow H$ then a totally multicolored induced copy of $H$ is unavoidable in any vertex-coloring of $G$ with $k$ colors. In this paper, we show that, with a few notable exceptions, for any graph $H$ on $k$ vertices and for any graph $G$ which is not isomorphic to $H$, $G\\not\\!\\rightarrow H$. We explicitly describe all exceptional ca"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.06172","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-18T01:14:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aTwK0+9q21FiHNcQw6K/AYuBIyuryrsGdPO36gU9mJEoOLUceq7zw/db4R3SiHDZB/LjCw700uBBVzwNv25DBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T20:42:03.352561Z"},"content_sha256":"bca98da5fcb60e092c56678c0feb8b68d1799f2bc6649cbf77cd0238ecfce3ae","schema_version":"1.0","event_id":"sha256:bca98da5fcb60e092c56678c0feb8b68d1799f2bc6649cbf77cd0238ecfce3ae"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VU32BGKR2DG3HQ5C6RC77YWWNP/bundle.json","state_url":"https://pith.science/pith/VU32BGKR2DG3HQ5C6RC77YWWNP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VU32BGKR2DG3HQ5C6RC77YWWNP/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-06-03T20:42:03Z","links":{"resolver":"https://pith.science/pith/VU32BGKR2DG3HQ5C6RC77YWWNP","bundle":"https://pith.science/pith/VU32BGKR2DG3HQ5C6RC77YWWNP/bundle.json","state":"https://pith.science/pith/VU32BGKR2DG3HQ5C6RC77YWWNP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VU32BGKR2DG3HQ5C6RC77YWWNP/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:VU32BGKR2DG3HQ5C6RC77YWWNP","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":"3d15d5701be1219968d36844ebf16d3429d67db39ed92b9e11757f2a1e84131c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-05-19T23:30:41Z","title_canon_sha256":"82ba325c4d8b8941823bf0a30fe70ae46107d91236e6411c4d946ab71c00c940"},"schema_version":"1.0","source":{"id":"1605.06172","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1605.06172","created_at":"2026-05-18T01:14:19Z"},{"alias_kind":"arxiv_version","alias_value":"1605.06172v1","created_at":"2026-05-18T01:14:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.06172","created_at":"2026-05-18T01:14:19Z"},{"alias_kind":"pith_short_12","alias_value":"VU32BGKR2DG3","created_at":"2026-05-18T12:30:48Z"},{"alias_kind":"pith_short_16","alias_value":"VU32BGKR2DG3HQ5C","created_at":"2026-05-18T12:30:48Z"},{"alias_kind":"pith_short_8","alias_value":"VU32BGKR","created_at":"2026-05-18T12:30:48Z"}],"graph_snapshots":[{"event_id":"sha256:bca98da5fcb60e092c56678c0feb8b68d1799f2bc6649cbf77cd0238ecfce3ae","target":"graph","created_at":"2026-05-18T01:14:19Z","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":"For a fixed graph $H$ on $k$ vertices, and a graph $G$ on at least $k$ vertices, we write $G\\rightarrow H$ if in any vertex-coloring of $G$ with $k$ colors, there is an induced subgraph isomorphic to $H$ whose vertices have distinct colors. In other words, if $G\\rightarrow H$ then a totally multicolored induced copy of $H$ is unavoidable in any vertex-coloring of $G$ with $k$ colors. In this paper, we show that, with a few notable exceptions, for any graph $H$ on $k$ vertices and for any graph $G$ which is not isomorphic to $H$, $G\\not\\!\\rightarrow H$. We explicitly describe all exceptional ca","authors_text":"Maria Axenovich, Ryan Martin","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-05-19T23:30:41Z","title":"Avoiding rainbow induced subgraphs in vertex-colorings"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.06172","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:6dcefc2fe34234d1c07d87cdc1e1b5548030f7bf513b10d6e9fbf08b523504b3","target":"record","created_at":"2026-05-18T01:14:19Z","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":"3d15d5701be1219968d36844ebf16d3429d67db39ed92b9e11757f2a1e84131c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-05-19T23:30:41Z","title_canon_sha256":"82ba325c4d8b8941823bf0a30fe70ae46107d91236e6411c4d946ab71c00c940"},"schema_version":"1.0","source":{"id":"1605.06172","kind":"arxiv","version":1}},"canonical_sha256":"ad37a09951d0cdb3c3a2f445ffe2d66be5b259ec342539ba5ee7ef7d696a4f2b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ad37a09951d0cdb3c3a2f445ffe2d66be5b259ec342539ba5ee7ef7d696a4f2b","first_computed_at":"2026-05-18T01:14:19.768587Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:14:19.768587Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"quQdUMcnkXTrMz6V8T2KEKXBsGSct9lVUDdtnJE4qUoXA/aV6nm/y56CtS6N1BPWdVk8jAuAMbb6FqhwdF1iCg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:14:19.769255Z","signed_message":"canonical_sha256_bytes"},"source_id":"1605.06172","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6dcefc2fe34234d1c07d87cdc1e1b5548030f7bf513b10d6e9fbf08b523504b3","sha256:bca98da5fcb60e092c56678c0feb8b68d1799f2bc6649cbf77cd0238ecfce3ae"],"state_sha256":"8e9a445a15a6a971401fee6afc66a133139fb4d70935dec2a4ca72da73e9be5a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tLn4w8UmqN0ZxZhW5OQVx3j2mdudYsRbXmHi0U1wJtbWkeZ1o2d9o/NrM22SDxpAbi9owvJnbr3tfTYRVBjpDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T20:42:03.354999Z","bundle_sha256":"08dce752b7e7b9ed8be1b08a34e70077d94a7e3910b1d1e531bae22b36c5c6f6"}}