{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:KHST3J64TH4IEIXGPEJFDECRII","short_pith_number":"pith:KHST3J64","canonical_record":{"source":{"id":"1705.08150","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-05-23T09:34:04Z","cross_cats_sorted":[],"title_canon_sha256":"94f8896e241da61911208d5817f09b1b718e9dc1369f92cbc6a09a092a6f4655","abstract_canon_sha256":"42f1b42d3be69be3c95aa7b54fb594b376f878d639a31b350097e4bfd24bff64"},"schema_version":"1.0"},"canonical_sha256":"51e53da7dc99f88222e67912519051423d296f9975cf4659640ddb4445850b7c","source":{"kind":"arxiv","id":"1705.08150","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1705.08150","created_at":"2026-05-18T00:43:49Z"},{"alias_kind":"arxiv_version","alias_value":"1705.08150v1","created_at":"2026-05-18T00:43:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.08150","created_at":"2026-05-18T00:43:49Z"},{"alias_kind":"pith_short_12","alias_value":"KHST3J64TH4I","created_at":"2026-05-18T12:31:24Z"},{"alias_kind":"pith_short_16","alias_value":"KHST3J64TH4IEIXG","created_at":"2026-05-18T12:31:24Z"},{"alias_kind":"pith_short_8","alias_value":"KHST3J64","created_at":"2026-05-18T12:31:24Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:KHST3J64TH4IEIXGPEJFDECRII","target":"record","payload":{"canonical_record":{"source":{"id":"1705.08150","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-05-23T09:34:04Z","cross_cats_sorted":[],"title_canon_sha256":"94f8896e241da61911208d5817f09b1b718e9dc1369f92cbc6a09a092a6f4655","abstract_canon_sha256":"42f1b42d3be69be3c95aa7b54fb594b376f878d639a31b350097e4bfd24bff64"},"schema_version":"1.0"},"canonical_sha256":"51e53da7dc99f88222e67912519051423d296f9975cf4659640ddb4445850b7c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:43:49.203349Z","signature_b64":"wE5m3tOtbqtOQ2dkLhhTbY919Md5qIIJz55WRLqxZh0d7dUdQXHJnGdc3lifAbhAz4IBe3yyVW5bIc0Ks8XZDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"51e53da7dc99f88222e67912519051423d296f9975cf4659640ddb4445850b7c","last_reissued_at":"2026-05-18T00:43:49.202731Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:43:49.202731Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1705.08150","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-18T00:43:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zHWtN9TDRsfojaL2i+VbVtHwMisD6A2xTI5YMwguBNHoS4C6onWyiI1cFqWyq+2F5hxQ4iGe94dknoI1IrBZBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T20:41:19.204090Z"},"content_sha256":"ed9da9af8d2544eec11ec2ca88cccd38353a9162ee28319e2c3511bb9ed86f07","schema_version":"1.0","event_id":"sha256:ed9da9af8d2544eec11ec2ca88cccd38353a9162ee28319e2c3511bb9ed86f07"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:KHST3J64TH4IEIXGPEJFDECRII","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Total weight choosability for Halin graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Tsai-Lien Wong, Xuding Zhu, Yu-Chang Liang","submitted_at":"2017-05-23T09:34:04Z","abstract_excerpt":"A proper total weighting of a graph $G$ is a mapping $\\phi$ which assigns to each vertex and each edge of $G$ a real number as its weight so that for any edge $uv$ of $G$, $\\sum_{e \\in E(v)}\\phi(e)+\\phi(v) \\ne \\sum_{e \\in E(u)}\\phi(e)+\\phi(u)$. A $(k,k')$-list assignment of $G$ is a mapping $L$ which assigns to each vertex $v$ a set $L(v)$ of $k$ permissible weights and to each edge $e$ a set $L(e)$ of $k'$ permissible weights. An $L$-total weighting is a total weighting $\\phi$ with $\\phi(z) \\in L(z)$ for each $z \\in V(G) \\cup E(G)$. A graph $G$ is called $(k,k')$-choosable if for every $(k,k'"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.08150","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-18T00:43:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QUXNLCy6V7mu9Q5DOT11yN0uaOtXGVaVBxol3NVzRnqfZd6YlPLq0N8ov6vT383L7ARuTjk6YnE0+eNBB2HMAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T20:41:19.204777Z"},"content_sha256":"8dbe1ca2c970186482820e51b6fb8a37f84d582971d96bc251391bb97f928729","schema_version":"1.0","event_id":"sha256:8dbe1ca2c970186482820e51b6fb8a37f84d582971d96bc251391bb97f928729"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KHST3J64TH4IEIXGPEJFDECRII/bundle.json","state_url":"https://pith.science/pith/KHST3J64TH4IEIXGPEJFDECRII/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KHST3J64TH4IEIXGPEJFDECRII/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-27T20:41:19Z","links":{"resolver":"https://pith.science/pith/KHST3J64TH4IEIXGPEJFDECRII","bundle":"https://pith.science/pith/KHST3J64TH4IEIXGPEJFDECRII/bundle.json","state":"https://pith.science/pith/KHST3J64TH4IEIXGPEJFDECRII/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KHST3J64TH4IEIXGPEJFDECRII/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:KHST3J64TH4IEIXGPEJFDECRII","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":"42f1b42d3be69be3c95aa7b54fb594b376f878d639a31b350097e4bfd24bff64","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-05-23T09:34:04Z","title_canon_sha256":"94f8896e241da61911208d5817f09b1b718e9dc1369f92cbc6a09a092a6f4655"},"schema_version":"1.0","source":{"id":"1705.08150","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1705.08150","created_at":"2026-05-18T00:43:49Z"},{"alias_kind":"arxiv_version","alias_value":"1705.08150v1","created_at":"2026-05-18T00:43:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.08150","created_at":"2026-05-18T00:43:49Z"},{"alias_kind":"pith_short_12","alias_value":"KHST3J64TH4I","created_at":"2026-05-18T12:31:24Z"},{"alias_kind":"pith_short_16","alias_value":"KHST3J64TH4IEIXG","created_at":"2026-05-18T12:31:24Z"},{"alias_kind":"pith_short_8","alias_value":"KHST3J64","created_at":"2026-05-18T12:31:24Z"}],"graph_snapshots":[{"event_id":"sha256:8dbe1ca2c970186482820e51b6fb8a37f84d582971d96bc251391bb97f928729","target":"graph","created_at":"2026-05-18T00:43:49Z","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 proper total weighting of a graph $G$ is a mapping $\\phi$ which assigns to each vertex and each edge of $G$ a real number as its weight so that for any edge $uv$ of $G$, $\\sum_{e \\in E(v)}\\phi(e)+\\phi(v) \\ne \\sum_{e \\in E(u)}\\phi(e)+\\phi(u)$. A $(k,k')$-list assignment of $G$ is a mapping $L$ which assigns to each vertex $v$ a set $L(v)$ of $k$ permissible weights and to each edge $e$ a set $L(e)$ of $k'$ permissible weights. An $L$-total weighting is a total weighting $\\phi$ with $\\phi(z) \\in L(z)$ for each $z \\in V(G) \\cup E(G)$. A graph $G$ is called $(k,k')$-choosable if for every $(k,k'","authors_text":"Tsai-Lien Wong, Xuding Zhu, Yu-Chang Liang","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-05-23T09:34:04Z","title":"Total weight choosability for Halin graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.08150","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:ed9da9af8d2544eec11ec2ca88cccd38353a9162ee28319e2c3511bb9ed86f07","target":"record","created_at":"2026-05-18T00:43:49Z","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":"42f1b42d3be69be3c95aa7b54fb594b376f878d639a31b350097e4bfd24bff64","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-05-23T09:34:04Z","title_canon_sha256":"94f8896e241da61911208d5817f09b1b718e9dc1369f92cbc6a09a092a6f4655"},"schema_version":"1.0","source":{"id":"1705.08150","kind":"arxiv","version":1}},"canonical_sha256":"51e53da7dc99f88222e67912519051423d296f9975cf4659640ddb4445850b7c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"51e53da7dc99f88222e67912519051423d296f9975cf4659640ddb4445850b7c","first_computed_at":"2026-05-18T00:43:49.202731Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:43:49.202731Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"wE5m3tOtbqtOQ2dkLhhTbY919Md5qIIJz55WRLqxZh0d7dUdQXHJnGdc3lifAbhAz4IBe3yyVW5bIc0Ks8XZDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:43:49.203349Z","signed_message":"canonical_sha256_bytes"},"source_id":"1705.08150","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ed9da9af8d2544eec11ec2ca88cccd38353a9162ee28319e2c3511bb9ed86f07","sha256:8dbe1ca2c970186482820e51b6fb8a37f84d582971d96bc251391bb97f928729"],"state_sha256":"9811c2f192185fa44fd7d5f87a1982a31007694360c131471db370c2a340f65a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gMUwnd+WrTb7qS3SrT9Cu9VlqnGBpRPSFW+NJFGFC6Syo8owHqkTl20P+9n8N0Q5MXT2O5lCTGY99rxNqpv8DA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T20:41:19.208375Z","bundle_sha256":"473926c347e25f8779e1c486d8a76f9c5e0a3ebbb3bfb87c45f7f5d32c45b743"}}