{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:XDPN47O66W4ZZFFNJEAWCAS4TE","short_pith_number":"pith:XDPN47O6","canonical_record":{"source":{"id":"1312.6503","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2013-12-23T10:05:36Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"9ee2c6da7af654dc66851e0c743b72a81862503f5b542b455c93a6d889739e41","abstract_canon_sha256":"f4f3de24983db82c68fa06929b5785e4b45ec80266fb158090c1143a6689d3f4"},"schema_version":"1.0"},"canonical_sha256":"b8dede7ddef5b99c94ad490161025c99031b6a45ec0a3da757e5ae1edac7a35d","source":{"kind":"arxiv","id":"1312.6503","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1312.6503","created_at":"2026-05-18T02:51:41Z"},{"alias_kind":"arxiv_version","alias_value":"1312.6503v2","created_at":"2026-05-18T02:51:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1312.6503","created_at":"2026-05-18T02:51:41Z"},{"alias_kind":"pith_short_12","alias_value":"XDPN47O66W4Z","created_at":"2026-05-18T12:28:06Z"},{"alias_kind":"pith_short_16","alias_value":"XDPN47O66W4ZZFFN","created_at":"2026-05-18T12:28:06Z"},{"alias_kind":"pith_short_8","alias_value":"XDPN47O6","created_at":"2026-05-18T12:28:06Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:XDPN47O66W4ZZFFNJEAWCAS4TE","target":"record","payload":{"canonical_record":{"source":{"id":"1312.6503","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2013-12-23T10:05:36Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"9ee2c6da7af654dc66851e0c743b72a81862503f5b542b455c93a6d889739e41","abstract_canon_sha256":"f4f3de24983db82c68fa06929b5785e4b45ec80266fb158090c1143a6689d3f4"},"schema_version":"1.0"},"canonical_sha256":"b8dede7ddef5b99c94ad490161025c99031b6a45ec0a3da757e5ae1edac7a35d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:51:41.828405Z","signature_b64":"U8fDVd0REi0jxqg31MUQ9hcWk0iRJThgVxAUUanal3x0UXUkZRCVvc385tMkFRlj4Mx/ywgk0kDp4aDWwzsKCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b8dede7ddef5b99c94ad490161025c99031b6a45ec0a3da757e5ae1edac7a35d","last_reissued_at":"2026-05-18T02:51:41.827942Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:51:41.827942Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1312.6503","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-18T02:51:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7ozsY7oyOOA51rAgouIgGvgCvafo91tPauVYGOiiMG0bfpBhifFf4UKCvVjQNUmRGMrSA7wm37yvVd9534EEAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T12:31:25.042852Z"},"content_sha256":"79d01acf821dc2287e622d4113f0fcd9db3ec1c87822a1808b6b1fef8dc49c8e","schema_version":"1.0","event_id":"sha256:79d01acf821dc2287e622d4113f0fcd9db3ec1c87822a1808b6b1fef8dc49c8e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:XDPN47O66W4ZZFFNJEAWCAS4TE","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the family of $r$-regular graphs with Grundy number $r+1$","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"Hamamache Kheddouci (LIRIS), LIRIS), Nicolas Gastineau (Le2i, Olivier Togni (Le2i)","submitted_at":"2013-12-23T10:05:36Z","abstract_excerpt":"The Grundy number of a graph $G$, denoted by $\\Gamma(G)$, is the largest $k$ such that there exists a partition of $V(G)$, into $k$ independent sets $V_1,\\ldots, V_k$ and every vertex of $V_i$ is adjacent to at least one vertex in $V_j$, for every $j < i$. The objects which are studied in this article are families of $r$-regular graphs such that $\\Gamma(G) = r + 1$. Using the notion of independent module, a characterization of this family is given for $r=3$. Moreover, we determine classes of graphs in this family, in particular the class of $r$-regular graphs without induced $C_4$, for $r \\le "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1312.6503","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-18T02:51:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lxS+OCkVbZ3YxzEBV+dg6Lyq7+cqeRQScyIwWtj6WJ0q9/OqkVX3ZF4xNtGizCBdGhPztRfFfip+JHuUpCBNBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T12:31:25.043187Z"},"content_sha256":"a25bc138d06566f7395fb6f87d521f2c0084d46e3803a11f52234d1140cc5139","schema_version":"1.0","event_id":"sha256:a25bc138d06566f7395fb6f87d521f2c0084d46e3803a11f52234d1140cc5139"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/XDPN47O66W4ZZFFNJEAWCAS4TE/bundle.json","state_url":"https://pith.science/pith/XDPN47O66W4ZZFFNJEAWCAS4TE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/XDPN47O66W4ZZFFNJEAWCAS4TE/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-01T12:31:25Z","links":{"resolver":"https://pith.science/pith/XDPN47O66W4ZZFFNJEAWCAS4TE","bundle":"https://pith.science/pith/XDPN47O66W4ZZFFNJEAWCAS4TE/bundle.json","state":"https://pith.science/pith/XDPN47O66W4ZZFFNJEAWCAS4TE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/XDPN47O66W4ZZFFNJEAWCAS4TE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:XDPN47O66W4ZZFFNJEAWCAS4TE","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":"f4f3de24983db82c68fa06929b5785e4b45ec80266fb158090c1143a6689d3f4","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2013-12-23T10:05:36Z","title_canon_sha256":"9ee2c6da7af654dc66851e0c743b72a81862503f5b542b455c93a6d889739e41"},"schema_version":"1.0","source":{"id":"1312.6503","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1312.6503","created_at":"2026-05-18T02:51:41Z"},{"alias_kind":"arxiv_version","alias_value":"1312.6503v2","created_at":"2026-05-18T02:51:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1312.6503","created_at":"2026-05-18T02:51:41Z"},{"alias_kind":"pith_short_12","alias_value":"XDPN47O66W4Z","created_at":"2026-05-18T12:28:06Z"},{"alias_kind":"pith_short_16","alias_value":"XDPN47O66W4ZZFFN","created_at":"2026-05-18T12:28:06Z"},{"alias_kind":"pith_short_8","alias_value":"XDPN47O6","created_at":"2026-05-18T12:28:06Z"}],"graph_snapshots":[{"event_id":"sha256:a25bc138d06566f7395fb6f87d521f2c0084d46e3803a11f52234d1140cc5139","target":"graph","created_at":"2026-05-18T02:51:41Z","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":"The Grundy number of a graph $G$, denoted by $\\Gamma(G)$, is the largest $k$ such that there exists a partition of $V(G)$, into $k$ independent sets $V_1,\\ldots, V_k$ and every vertex of $V_i$ is adjacent to at least one vertex in $V_j$, for every $j < i$. The objects which are studied in this article are families of $r$-regular graphs such that $\\Gamma(G) = r + 1$. Using the notion of independent module, a characterization of this family is given for $r=3$. Moreover, we determine classes of graphs in this family, in particular the class of $r$-regular graphs without induced $C_4$, for $r \\le ","authors_text":"Hamamache Kheddouci (LIRIS), LIRIS), Nicolas Gastineau (Le2i, Olivier Togni (Le2i)","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2013-12-23T10:05:36Z","title":"On the family of $r$-regular graphs with Grundy number $r+1$"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1312.6503","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:79d01acf821dc2287e622d4113f0fcd9db3ec1c87822a1808b6b1fef8dc49c8e","target":"record","created_at":"2026-05-18T02:51:41Z","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":"f4f3de24983db82c68fa06929b5785e4b45ec80266fb158090c1143a6689d3f4","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2013-12-23T10:05:36Z","title_canon_sha256":"9ee2c6da7af654dc66851e0c743b72a81862503f5b542b455c93a6d889739e41"},"schema_version":"1.0","source":{"id":"1312.6503","kind":"arxiv","version":2}},"canonical_sha256":"b8dede7ddef5b99c94ad490161025c99031b6a45ec0a3da757e5ae1edac7a35d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b8dede7ddef5b99c94ad490161025c99031b6a45ec0a3da757e5ae1edac7a35d","first_computed_at":"2026-05-18T02:51:41.827942Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:51:41.827942Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"U8fDVd0REi0jxqg31MUQ9hcWk0iRJThgVxAUUanal3x0UXUkZRCVvc385tMkFRlj4Mx/ywgk0kDp4aDWwzsKCg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:51:41.828405Z","signed_message":"canonical_sha256_bytes"},"source_id":"1312.6503","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:79d01acf821dc2287e622d4113f0fcd9db3ec1c87822a1808b6b1fef8dc49c8e","sha256:a25bc138d06566f7395fb6f87d521f2c0084d46e3803a11f52234d1140cc5139"],"state_sha256":"b860a8749c6516110584f4bd33a3749c4639fc806d1cb238d8442fbc8987310c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ALNUGj+ItWVD7DhlR5CpkQbQBlr95zvtUyK8yF/F/vOhvFCqBURAkXc0WS0UomgzKGvgBsNbQzdB9JaS5gxEAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T12:31:25.045066Z","bundle_sha256":"dc929e0ab5d2132b5a2f7bbb22a6ea5bb59ad9b7b2c3ec886572fb894f001dcf"}}