{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:FXIH7E5XEXLQMHTBCO3Z4XI2DN","short_pith_number":"pith:FXIH7E5X","canonical_record":{"source":{"id":"1507.01080","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-07-04T08:25:02Z","cross_cats_sorted":[],"title_canon_sha256":"f8bc12c0574f610805e4c0a09976889bf0d848380cb0277b03a5e061593877bd","abstract_canon_sha256":"fa2f782b6222587dedddfecb10d33e4349bb8b7e44fff67ac4795ca128e0ed69"},"schema_version":"1.0"},"canonical_sha256":"2dd07f93b725d7061e6113b79e5d1a1b77e5effbd627a9cd523b0f08b2ea4e09","source":{"kind":"arxiv","id":"1507.01080","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1507.01080","created_at":"2026-05-18T01:24:43Z"},{"alias_kind":"arxiv_version","alias_value":"1507.01080v2","created_at":"2026-05-18T01:24:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.01080","created_at":"2026-05-18T01:24:43Z"},{"alias_kind":"pith_short_12","alias_value":"FXIH7E5XEXLQ","created_at":"2026-05-18T12:29:22Z"},{"alias_kind":"pith_short_16","alias_value":"FXIH7E5XEXLQMHTB","created_at":"2026-05-18T12:29:22Z"},{"alias_kind":"pith_short_8","alias_value":"FXIH7E5X","created_at":"2026-05-18T12:29:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:FXIH7E5XEXLQMHTBCO3Z4XI2DN","target":"record","payload":{"canonical_record":{"source":{"id":"1507.01080","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-07-04T08:25:02Z","cross_cats_sorted":[],"title_canon_sha256":"f8bc12c0574f610805e4c0a09976889bf0d848380cb0277b03a5e061593877bd","abstract_canon_sha256":"fa2f782b6222587dedddfecb10d33e4349bb8b7e44fff67ac4795ca128e0ed69"},"schema_version":"1.0"},"canonical_sha256":"2dd07f93b725d7061e6113b79e5d1a1b77e5effbd627a9cd523b0f08b2ea4e09","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:24:43.670986Z","signature_b64":"sA96G9SeLyMAzyd/6NJbkjqoRNBJ9IUKWpWHUiu+W/NJkBIY76oHXCPkxxOsv0GWASd0JCHuzYDUyLg2qVtTBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2dd07f93b725d7061e6113b79e5d1a1b77e5effbd627a9cd523b0f08b2ea4e09","last_reissued_at":"2026-05-18T01:24:43.670516Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:24:43.670516Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1507.01080","source_version":2,"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:24:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NQeEZfZC/nxndtdIEH6NsTEKGvZhBdIbUA9FD4BEUJht8cuDq4QOEHExFOWD5rbVQHqvKWGkqs3QID2Ie9SvAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T17:35:07.815812Z"},"content_sha256":"2f243fb871a50c7a794bc47a93f05100eee39d16abdfc955bc4eacb16d985149","schema_version":"1.0","event_id":"sha256:2f243fb871a50c7a794bc47a93f05100eee39d16abdfc955bc4eacb16d985149"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:FXIH7E5XEXLQMHTBCO3Z4XI2DN","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"More bounds for the Grundy number of graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Baoyindureng Wu, Lin Hu, Manoucheher Zaker, Zixing Tang","submitted_at":"2015-07-04T08:25:02Z","abstract_excerpt":"A coloring of a graph $G=(V,E)$ is a partition $\\{V_1, V_2, \\ldots, V_k\\}$ of $V$ into independent sets or color classes. A vertex $v\\in V_i$ is a Grundy vertex if it is adjacent to at least one vertex in each color class $V_j$ for every $j<i$. A coloring is a Grundy coloring if every vertex is a Grundy vertex, and the Grundy number $\\Gamma(G)$ of a graph $G$ is the maximum number of colors in a Grundy coloring. We provide two new upper bounds on Grundy number of a graph and a stronger version of the well-known Nordhaus-Gaddum theorem. In addition, we give a new characterization for a $\\{P_{4}"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.01080","kind":"arxiv","version":2},"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:24:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0UmVM+k1X6ifPQLBLrP/CD/pSAhnl4S//SU+Xohs08ZOBpAO5rBytNl7pFsS6O5IZUEzyPCvxDa3kGgn4rljBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T17:35:07.816171Z"},"content_sha256":"056652a5ba4615f38b97cd1751a514a808303c63ef515820186bd18ba067c4ed","schema_version":"1.0","event_id":"sha256:056652a5ba4615f38b97cd1751a514a808303c63ef515820186bd18ba067c4ed"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FXIH7E5XEXLQMHTBCO3Z4XI2DN/bundle.json","state_url":"https://pith.science/pith/FXIH7E5XEXLQMHTBCO3Z4XI2DN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FXIH7E5XEXLQMHTBCO3Z4XI2DN/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-02T17:35:07Z","links":{"resolver":"https://pith.science/pith/FXIH7E5XEXLQMHTBCO3Z4XI2DN","bundle":"https://pith.science/pith/FXIH7E5XEXLQMHTBCO3Z4XI2DN/bundle.json","state":"https://pith.science/pith/FXIH7E5XEXLQMHTBCO3Z4XI2DN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FXIH7E5XEXLQMHTBCO3Z4XI2DN/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:FXIH7E5XEXLQMHTBCO3Z4XI2DN","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":"fa2f782b6222587dedddfecb10d33e4349bb8b7e44fff67ac4795ca128e0ed69","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-07-04T08:25:02Z","title_canon_sha256":"f8bc12c0574f610805e4c0a09976889bf0d848380cb0277b03a5e061593877bd"},"schema_version":"1.0","source":{"id":"1507.01080","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1507.01080","created_at":"2026-05-18T01:24:43Z"},{"alias_kind":"arxiv_version","alias_value":"1507.01080v2","created_at":"2026-05-18T01:24:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.01080","created_at":"2026-05-18T01:24:43Z"},{"alias_kind":"pith_short_12","alias_value":"FXIH7E5XEXLQ","created_at":"2026-05-18T12:29:22Z"},{"alias_kind":"pith_short_16","alias_value":"FXIH7E5XEXLQMHTB","created_at":"2026-05-18T12:29:22Z"},{"alias_kind":"pith_short_8","alias_value":"FXIH7E5X","created_at":"2026-05-18T12:29:22Z"}],"graph_snapshots":[{"event_id":"sha256:056652a5ba4615f38b97cd1751a514a808303c63ef515820186bd18ba067c4ed","target":"graph","created_at":"2026-05-18T01:24:43Z","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":"A coloring of a graph $G=(V,E)$ is a partition $\\{V_1, V_2, \\ldots, V_k\\}$ of $V$ into independent sets or color classes. A vertex $v\\in V_i$ is a Grundy vertex if it is adjacent to at least one vertex in each color class $V_j$ for every $j<i$. A coloring is a Grundy coloring if every vertex is a Grundy vertex, and the Grundy number $\\Gamma(G)$ of a graph $G$ is the maximum number of colors in a Grundy coloring. We provide two new upper bounds on Grundy number of a graph and a stronger version of the well-known Nordhaus-Gaddum theorem. In addition, we give a new characterization for a $\\{P_{4}","authors_text":"Baoyindureng Wu, Lin Hu, Manoucheher Zaker, Zixing Tang","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-07-04T08:25:02Z","title":"More bounds for the Grundy number of graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.01080","kind":"arxiv","version":2},"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:2f243fb871a50c7a794bc47a93f05100eee39d16abdfc955bc4eacb16d985149","target":"record","created_at":"2026-05-18T01:24:43Z","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":"fa2f782b6222587dedddfecb10d33e4349bb8b7e44fff67ac4795ca128e0ed69","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-07-04T08:25:02Z","title_canon_sha256":"f8bc12c0574f610805e4c0a09976889bf0d848380cb0277b03a5e061593877bd"},"schema_version":"1.0","source":{"id":"1507.01080","kind":"arxiv","version":2}},"canonical_sha256":"2dd07f93b725d7061e6113b79e5d1a1b77e5effbd627a9cd523b0f08b2ea4e09","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2dd07f93b725d7061e6113b79e5d1a1b77e5effbd627a9cd523b0f08b2ea4e09","first_computed_at":"2026-05-18T01:24:43.670516Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:24:43.670516Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"sA96G9SeLyMAzyd/6NJbkjqoRNBJ9IUKWpWHUiu+W/NJkBIY76oHXCPkxxOsv0GWASd0JCHuzYDUyLg2qVtTBA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:24:43.670986Z","signed_message":"canonical_sha256_bytes"},"source_id":"1507.01080","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2f243fb871a50c7a794bc47a93f05100eee39d16abdfc955bc4eacb16d985149","sha256:056652a5ba4615f38b97cd1751a514a808303c63ef515820186bd18ba067c4ed"],"state_sha256":"2ba14c6e6388a0bd3c64e8eb29835a9d63fb03122e82036e70315b361248728f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Obz2FLZ62yn18vrzruNFJoaQ8pkQvSQLLpw88oRAauFu/+bif/DUSqgmxeqteXPWCsHMzm/db/X4kPmMZUxMCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T17:35:07.818380Z","bundle_sha256":"18c9c62d04b426a869e5aa9394d03607c3ce9ac087827b3eef8988f3f1fe3908"}}