{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:VABC7T4WNIIDZUSZ75B72KGA3M","short_pith_number":"pith:VABC7T4W","canonical_record":{"source":{"id":"1510.00809","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-10-03T12:15:15Z","cross_cats_sorted":[],"title_canon_sha256":"2e2926834cd26a618a63f8e11559ab208d2145af0c1d2fc42e585942252dd71e","abstract_canon_sha256":"d3ee7946ca2d44945efb9a616e03877f6b737f6226daa774b25dcacc5d4d0a62"},"schema_version":"1.0"},"canonical_sha256":"a8022fcf966a103cd259ff43fd28c0db145132f74d8d025eed1b2391382f57ab","source":{"kind":"arxiv","id":"1510.00809","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1510.00809","created_at":"2026-05-18T01:31:05Z"},{"alias_kind":"arxiv_version","alias_value":"1510.00809v1","created_at":"2026-05-18T01:31:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1510.00809","created_at":"2026-05-18T01:31:05Z"},{"alias_kind":"pith_short_12","alias_value":"VABC7T4WNIID","created_at":"2026-05-18T12:29:44Z"},{"alias_kind":"pith_short_16","alias_value":"VABC7T4WNIIDZUSZ","created_at":"2026-05-18T12:29:44Z"},{"alias_kind":"pith_short_8","alias_value":"VABC7T4W","created_at":"2026-05-18T12:29:44Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:VABC7T4WNIIDZUSZ75B72KGA3M","target":"record","payload":{"canonical_record":{"source":{"id":"1510.00809","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-10-03T12:15:15Z","cross_cats_sorted":[],"title_canon_sha256":"2e2926834cd26a618a63f8e11559ab208d2145af0c1d2fc42e585942252dd71e","abstract_canon_sha256":"d3ee7946ca2d44945efb9a616e03877f6b737f6226daa774b25dcacc5d4d0a62"},"schema_version":"1.0"},"canonical_sha256":"a8022fcf966a103cd259ff43fd28c0db145132f74d8d025eed1b2391382f57ab","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:31:05.613599Z","signature_b64":"T/J18UfBgmQwA5NAsYz7x2rRi2dgci4XiRORIgL/6Dm0tCQp+p/IWFFU9WHJNfzCNk+7iAEMnp69F7LnwqWICw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a8022fcf966a103cd259ff43fd28c0db145132f74d8d025eed1b2391382f57ab","last_reissued_at":"2026-05-18T01:31:05.612862Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:31:05.612862Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1510.00809","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:31:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+C5dffSriIEFblrcOl5ts37kWQtXt3aMY69SLjqb5S9xlp54QUnpMs4K3gmLhJP8l/7+QcEc/u49ibpgh+nvCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T18:19:07.625422Z"},"content_sha256":"783daab658749d66cf1a8a586b2c3c062fa881c0a2744f1359922b6194a3eab3","schema_version":"1.0","event_id":"sha256:783daab658749d66cf1a8a586b2c3c062fa881c0a2744f1359922b6194a3eab3"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:VABC7T4WNIIDZUSZ75B72KGA3M","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Total weight choosability of d-degenerate graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Tsai-Lien Wong, Xuding Zhu","submitted_at":"2015-10-03T12:15:15Z","abstract_excerpt":"A graph $G$ is $(k,k')$-choosable if the following holds: For any list assignment $L$ which assigns to each vertex $v$ a set $L(v)$ of $k$ real numbers, and assigns to each edge $e$ a set $L(e)$ of $k'$ real numbers, there is a total weighting\n  $\\phi: V(G) \\cup E(G) \\to R$ such that $\\phi(z) \\in L(z)$ for $z \\in V \\cup E$, and $\\sum_{e \\in E(u)}\\phi(e)+\\phi(u) \\ne \\sum_{e \\in E(v)}\\phi(e)+\\phi(v)$ for every edge $uv$. This paper proves the following results: (1) If $G$ is a connected $d$-degenerate graph, and $k>d$ is a prime number, and $G$ is either non-bipartite or has two non-adjacent ver"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1510.00809","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:31:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qvT3mU6n+uwlaSlNng2P89d5pg0ptVSGGPF0UN1kQWJ3KirNwwNvxlX7uF4ZRNXgkIREKjfOarKwhb/c33oQCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T18:19:07.625803Z"},"content_sha256":"81a22a98790663f882ba51bb310b1c4f1021723cebc72a122ee4e0f75663d7b2","schema_version":"1.0","event_id":"sha256:81a22a98790663f882ba51bb310b1c4f1021723cebc72a122ee4e0f75663d7b2"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VABC7T4WNIIDZUSZ75B72KGA3M/bundle.json","state_url":"https://pith.science/pith/VABC7T4WNIIDZUSZ75B72KGA3M/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VABC7T4WNIIDZUSZ75B72KGA3M/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-31T18:19:07Z","links":{"resolver":"https://pith.science/pith/VABC7T4WNIIDZUSZ75B72KGA3M","bundle":"https://pith.science/pith/VABC7T4WNIIDZUSZ75B72KGA3M/bundle.json","state":"https://pith.science/pith/VABC7T4WNIIDZUSZ75B72KGA3M/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VABC7T4WNIIDZUSZ75B72KGA3M/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:VABC7T4WNIIDZUSZ75B72KGA3M","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":"d3ee7946ca2d44945efb9a616e03877f6b737f6226daa774b25dcacc5d4d0a62","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-10-03T12:15:15Z","title_canon_sha256":"2e2926834cd26a618a63f8e11559ab208d2145af0c1d2fc42e585942252dd71e"},"schema_version":"1.0","source":{"id":"1510.00809","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1510.00809","created_at":"2026-05-18T01:31:05Z"},{"alias_kind":"arxiv_version","alias_value":"1510.00809v1","created_at":"2026-05-18T01:31:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1510.00809","created_at":"2026-05-18T01:31:05Z"},{"alias_kind":"pith_short_12","alias_value":"VABC7T4WNIID","created_at":"2026-05-18T12:29:44Z"},{"alias_kind":"pith_short_16","alias_value":"VABC7T4WNIIDZUSZ","created_at":"2026-05-18T12:29:44Z"},{"alias_kind":"pith_short_8","alias_value":"VABC7T4W","created_at":"2026-05-18T12:29:44Z"}],"graph_snapshots":[{"event_id":"sha256:81a22a98790663f882ba51bb310b1c4f1021723cebc72a122ee4e0f75663d7b2","target":"graph","created_at":"2026-05-18T01:31:05Z","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 $(k,k')$-choosable if the following holds: For any list assignment $L$ which assigns to each vertex $v$ a set $L(v)$ of $k$ real numbers, and assigns to each edge $e$ a set $L(e)$ of $k'$ real numbers, there is a total weighting\n  $\\phi: V(G) \\cup E(G) \\to R$ such that $\\phi(z) \\in L(z)$ for $z \\in V \\cup E$, and $\\sum_{e \\in E(u)}\\phi(e)+\\phi(u) \\ne \\sum_{e \\in E(v)}\\phi(e)+\\phi(v)$ for every edge $uv$. This paper proves the following results: (1) If $G$ is a connected $d$-degenerate graph, and $k>d$ is a prime number, and $G$ is either non-bipartite or has two non-adjacent ver","authors_text":"Tsai-Lien Wong, Xuding Zhu","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-10-03T12:15:15Z","title":"Total weight choosability of d-degenerate graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1510.00809","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:783daab658749d66cf1a8a586b2c3c062fa881c0a2744f1359922b6194a3eab3","target":"record","created_at":"2026-05-18T01:31:05Z","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":"d3ee7946ca2d44945efb9a616e03877f6b737f6226daa774b25dcacc5d4d0a62","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-10-03T12:15:15Z","title_canon_sha256":"2e2926834cd26a618a63f8e11559ab208d2145af0c1d2fc42e585942252dd71e"},"schema_version":"1.0","source":{"id":"1510.00809","kind":"arxiv","version":1}},"canonical_sha256":"a8022fcf966a103cd259ff43fd28c0db145132f74d8d025eed1b2391382f57ab","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a8022fcf966a103cd259ff43fd28c0db145132f74d8d025eed1b2391382f57ab","first_computed_at":"2026-05-18T01:31:05.612862Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:31:05.612862Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"T/J18UfBgmQwA5NAsYz7x2rRi2dgci4XiRORIgL/6Dm0tCQp+p/IWFFU9WHJNfzCNk+7iAEMnp69F7LnwqWICw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:31:05.613599Z","signed_message":"canonical_sha256_bytes"},"source_id":"1510.00809","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:783daab658749d66cf1a8a586b2c3c062fa881c0a2744f1359922b6194a3eab3","sha256:81a22a98790663f882ba51bb310b1c4f1021723cebc72a122ee4e0f75663d7b2"],"state_sha256":"fc0a26b0c885d4552f8a561b20c8e5d143ed98f39988c6fb607ba7b590f42c5a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lIeakF8VYlJ2XWLLZMVuSAwczdka3W/0VTCpsPmhhXgorCP28qD40nJabQeCSRhYO6s0P49w85GbkF7r8xGzDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T18:19:07.628506Z","bundle_sha256":"a7f4e6aec251757e79a97785352ef26e02734c25ec337fbbd2e0154485c169cf"}}