{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:WUKSFT7XN5ZI23L2EJZKSJ6VQS","short_pith_number":"pith:WUKSFT7X","canonical_record":{"source":{"id":"1403.2809","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-03-12T04:44:08Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"430398217a631d183a354e0d2ef56ddab8e330df7faadb4a7822f22dfd9d79b7","abstract_canon_sha256":"48f1a519728e43fc1e03651bcf79cd1bb60b138b6a3b9bc6a0f0c722a9e253a4"},"schema_version":"1.0"},"canonical_sha256":"b51522cff76f728d6d7a2272a927d5849030b36f572cda4129109f3f19350a3f","source":{"kind":"arxiv","id":"1403.2809","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1403.2809","created_at":"2026-05-18T02:56:34Z"},{"alias_kind":"arxiv_version","alias_value":"1403.2809v1","created_at":"2026-05-18T02:56:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1403.2809","created_at":"2026-05-18T02:56:34Z"},{"alias_kind":"pith_short_12","alias_value":"WUKSFT7XN5ZI","created_at":"2026-05-18T12:28:54Z"},{"alias_kind":"pith_short_16","alias_value":"WUKSFT7XN5ZI23L2","created_at":"2026-05-18T12:28:54Z"},{"alias_kind":"pith_short_8","alias_value":"WUKSFT7X","created_at":"2026-05-18T12:28:54Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:WUKSFT7XN5ZI23L2EJZKSJ6VQS","target":"record","payload":{"canonical_record":{"source":{"id":"1403.2809","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-03-12T04:44:08Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"430398217a631d183a354e0d2ef56ddab8e330df7faadb4a7822f22dfd9d79b7","abstract_canon_sha256":"48f1a519728e43fc1e03651bcf79cd1bb60b138b6a3b9bc6a0f0c722a9e253a4"},"schema_version":"1.0"},"canonical_sha256":"b51522cff76f728d6d7a2272a927d5849030b36f572cda4129109f3f19350a3f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:56:34.013963Z","signature_b64":"HE967cy6Gu0P8J5ERobgMs4M01PJxVcSscT3EanfJ0wcjkoJQjSyZb6WNXPxqn9bAJH0gJVRF5i/hNbLTDpCBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b51522cff76f728d6d7a2272a927d5849030b36f572cda4129109f3f19350a3f","last_reissued_at":"2026-05-18T02:56:34.013157Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:56:34.013157Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1403.2809","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-18T02:56:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"T3n0i2nYHQTImZIWQWvjSPz6NrK+ldfG0Y9B4JndDU34RWgUhKoFxACOvu+vrh6bawkkPEQwzQL2ZfDin2o0Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T05:46:19.771760Z"},"content_sha256":"618525eb2bff0a044d75eddc7fd2acadcd2a777e8795e075be436efca6e316c4","schema_version":"1.0","event_id":"sha256:618525eb2bff0a044d75eddc7fd2acadcd2a777e8795e075be436efca6e316c4"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:WUKSFT7XN5ZI23L2EJZKSJ6VQS","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Equitable list point arboricity of graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Xin Zhang","submitted_at":"2014-03-12T04:44:08Z","abstract_excerpt":"A graph $G$ is list point $k$-arborable if, whenever we are given a $k$-list assignment $L(v)$ of colors for each vertex $v\\in V(G)$, we can choose a color $c(v)\\in L(v)$ for each vertex $v$ so that each color class induces an acyclic subgraph of $G$, and is equitable list point $k$-arborable if $G$ is list point $k$-arborable and each color appears on at most $\\lceil |V(G)|/k\\rceil$ vertices of $G$. In this paper, we conjecture that every graph $G$ is equitable list point $k$-arborable for every $k\\geq \\lceil(\\Delta(G)+1)/2\\rceil$ and settle this for complete graphs, 2-degenerate graphs, 3-de"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1403.2809","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-18T02:56:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"v7hZmLkfSLeXqOalkqun+hqW7sgn2vYOx6S5+hozux+5TZkLrq8zj90qSOl0Y4bUKtRkkX6KlbZZISe9Jw0BBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T05:46:19.772507Z"},"content_sha256":"3416e8f938a467e0b5bb3519c1ef352150905c0f4cda0e8d5975b1155b7ae2af","schema_version":"1.0","event_id":"sha256:3416e8f938a467e0b5bb3519c1ef352150905c0f4cda0e8d5975b1155b7ae2af"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WUKSFT7XN5ZI23L2EJZKSJ6VQS/bundle.json","state_url":"https://pith.science/pith/WUKSFT7XN5ZI23L2EJZKSJ6VQS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WUKSFT7XN5ZI23L2EJZKSJ6VQS/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-09T05:46:19Z","links":{"resolver":"https://pith.science/pith/WUKSFT7XN5ZI23L2EJZKSJ6VQS","bundle":"https://pith.science/pith/WUKSFT7XN5ZI23L2EJZKSJ6VQS/bundle.json","state":"https://pith.science/pith/WUKSFT7XN5ZI23L2EJZKSJ6VQS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WUKSFT7XN5ZI23L2EJZKSJ6VQS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:WUKSFT7XN5ZI23L2EJZKSJ6VQS","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":"48f1a519728e43fc1e03651bcf79cd1bb60b138b6a3b9bc6a0f0c722a9e253a4","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-03-12T04:44:08Z","title_canon_sha256":"430398217a631d183a354e0d2ef56ddab8e330df7faadb4a7822f22dfd9d79b7"},"schema_version":"1.0","source":{"id":"1403.2809","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1403.2809","created_at":"2026-05-18T02:56:34Z"},{"alias_kind":"arxiv_version","alias_value":"1403.2809v1","created_at":"2026-05-18T02:56:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1403.2809","created_at":"2026-05-18T02:56:34Z"},{"alias_kind":"pith_short_12","alias_value":"WUKSFT7XN5ZI","created_at":"2026-05-18T12:28:54Z"},{"alias_kind":"pith_short_16","alias_value":"WUKSFT7XN5ZI23L2","created_at":"2026-05-18T12:28:54Z"},{"alias_kind":"pith_short_8","alias_value":"WUKSFT7X","created_at":"2026-05-18T12:28:54Z"}],"graph_snapshots":[{"event_id":"sha256:3416e8f938a467e0b5bb3519c1ef352150905c0f4cda0e8d5975b1155b7ae2af","target":"graph","created_at":"2026-05-18T02:56:34Z","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 graph $G$ is list point $k$-arborable if, whenever we are given a $k$-list assignment $L(v)$ of colors for each vertex $v\\in V(G)$, we can choose a color $c(v)\\in L(v)$ for each vertex $v$ so that each color class induces an acyclic subgraph of $G$, and is equitable list point $k$-arborable if $G$ is list point $k$-arborable and each color appears on at most $\\lceil |V(G)|/k\\rceil$ vertices of $G$. In this paper, we conjecture that every graph $G$ is equitable list point $k$-arborable for every $k\\geq \\lceil(\\Delta(G)+1)/2\\rceil$ and settle this for complete graphs, 2-degenerate graphs, 3-de","authors_text":"Xin Zhang","cross_cats":["cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-03-12T04:44:08Z","title":"Equitable list point arboricity of graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1403.2809","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:618525eb2bff0a044d75eddc7fd2acadcd2a777e8795e075be436efca6e316c4","target":"record","created_at":"2026-05-18T02:56:34Z","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":"48f1a519728e43fc1e03651bcf79cd1bb60b138b6a3b9bc6a0f0c722a9e253a4","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-03-12T04:44:08Z","title_canon_sha256":"430398217a631d183a354e0d2ef56ddab8e330df7faadb4a7822f22dfd9d79b7"},"schema_version":"1.0","source":{"id":"1403.2809","kind":"arxiv","version":1}},"canonical_sha256":"b51522cff76f728d6d7a2272a927d5849030b36f572cda4129109f3f19350a3f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b51522cff76f728d6d7a2272a927d5849030b36f572cda4129109f3f19350a3f","first_computed_at":"2026-05-18T02:56:34.013157Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:56:34.013157Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"HE967cy6Gu0P8J5ERobgMs4M01PJxVcSscT3EanfJ0wcjkoJQjSyZb6WNXPxqn9bAJH0gJVRF5i/hNbLTDpCBA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:56:34.013963Z","signed_message":"canonical_sha256_bytes"},"source_id":"1403.2809","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:618525eb2bff0a044d75eddc7fd2acadcd2a777e8795e075be436efca6e316c4","sha256:3416e8f938a467e0b5bb3519c1ef352150905c0f4cda0e8d5975b1155b7ae2af"],"state_sha256":"9332afbd947afd9a4eb5532b0c734e915c815a88b9eb3d4bb20f493498e4994d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gkUIoZ3/tjJqL0HBNc9/ukt3u/PuzSk/xPzrmMIV0IIHgc2WV8hhSxt0I22lBL3BKv6uUOdnc2YDzaE82KpsCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T05:46:19.775985Z","bundle_sha256":"6e25ce261a3a507692951c100f79a8bd8bd46d6dfe5f94f0652618f221cdf3e3"}}