{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:FZFEHTR4VJDIA35HAWXI3PWZVO","short_pith_number":"pith:FZFEHTR4","canonical_record":{"source":{"id":"1103.2087","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-03-10T17:35:11Z","cross_cats_sorted":[],"title_canon_sha256":"1f32e2790d3129cb3ef30a4131f307024562283199bfe65398ac2c84620fc64a","abstract_canon_sha256":"d03f9f2ab5b6b37200bfac1558ab3e467c159677d277091becc792e76f29c404"},"schema_version":"1.0"},"canonical_sha256":"2e4a43ce3caa46806fa705ae8dbed9aba549a99487ffe18c51d6b196b0a52754","source":{"kind":"arxiv","id":"1103.2087","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1103.2087","created_at":"2026-05-18T04:27:03Z"},{"alias_kind":"arxiv_version","alias_value":"1103.2087v1","created_at":"2026-05-18T04:27:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1103.2087","created_at":"2026-05-18T04:27:03Z"},{"alias_kind":"pith_short_12","alias_value":"FZFEHTR4VJDI","created_at":"2026-05-18T12:26:28Z"},{"alias_kind":"pith_short_16","alias_value":"FZFEHTR4VJDIA35H","created_at":"2026-05-18T12:26:28Z"},{"alias_kind":"pith_short_8","alias_value":"FZFEHTR4","created_at":"2026-05-18T12:26:28Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:FZFEHTR4VJDIA35HAWXI3PWZVO","target":"record","payload":{"canonical_record":{"source":{"id":"1103.2087","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-03-10T17:35:11Z","cross_cats_sorted":[],"title_canon_sha256":"1f32e2790d3129cb3ef30a4131f307024562283199bfe65398ac2c84620fc64a","abstract_canon_sha256":"d03f9f2ab5b6b37200bfac1558ab3e467c159677d277091becc792e76f29c404"},"schema_version":"1.0"},"canonical_sha256":"2e4a43ce3caa46806fa705ae8dbed9aba549a99487ffe18c51d6b196b0a52754","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:27:03.013731Z","signature_b64":"VrIxSe3AlFAiGSVnsVi0ju0JlBm55h119jkkBOz6st2WBD9RPA/EEabKOM2vfL7U8YjwyJQEh23VynfjHeY1Dg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2e4a43ce3caa46806fa705ae8dbed9aba549a99487ffe18c51d6b196b0a52754","last_reissued_at":"2026-05-18T04:27:03.013047Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:27:03.013047Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1103.2087","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-18T04:27:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9Ci35un3PSYdYUPTYFcsRyXfZdQAZEof7VyFQ6j6IRXe/M6hoOv5Je/K21zERggTyPZN67Xk+j/SkB0UMQupCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T07:43:14.824578Z"},"content_sha256":"6dd67b3dbf33e361e5bb24a4589a84cd48c0f09856f8f96d3524e1996365e939","schema_version":"1.0","event_id":"sha256:6dd67b3dbf33e361e5bb24a4589a84cd48c0f09856f8f96d3524e1996365e939"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:FZFEHTR4VJDIA35HAWXI3PWZVO","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Total Vertex Irregularity Strength of Forests","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Florian Pfender, Marcin Anholcer, Micha{\\l} Karo\\'nski","submitted_at":"2011-03-10T17:35:11Z","abstract_excerpt":"We investigate a graph parameter called the total vertex irregularity strength ($tvs(G)$), i.e. the minimal $s$ such that there is a labeling $w: E(G)\\cup V(G)\\rightarrow \\{1,2,..,s\\}$ of the edges and vertices of $G$ giving distinct weighted degrees $wt_G(v):=w(v)+\\sum_{v\\in e \\in E(G)}w(e)$ for every pair of vertices of $G$. We prove that $tvs(F)=\\lceil (n_1+1)/2 \\rceil$ for every forest $F$ with no vertices of degree 2 and no isolated vertices, where $n_1$ is the number of pendant vertices in $F$. Stronger results for trees were recently proved by Nurdin et al."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1103.2087","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-18T04:27:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xVRPojQf9G1z2Aay+rrGr5bzL1yGxm/rZQQHIdbDoUNq341DdFAh0Pgbc2hV6UZSL5YU5v50Us9TSWyk9IenDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T07:43:14.825768Z"},"content_sha256":"56351775f44ea3f9b1ad7033d41ee6b20ade62b6e2391d1ea892198c31c362fc","schema_version":"1.0","event_id":"sha256:56351775f44ea3f9b1ad7033d41ee6b20ade62b6e2391d1ea892198c31c362fc"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FZFEHTR4VJDIA35HAWXI3PWZVO/bundle.json","state_url":"https://pith.science/pith/FZFEHTR4VJDIA35HAWXI3PWZVO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FZFEHTR4VJDIA35HAWXI3PWZVO/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-30T07:43:14Z","links":{"resolver":"https://pith.science/pith/FZFEHTR4VJDIA35HAWXI3PWZVO","bundle":"https://pith.science/pith/FZFEHTR4VJDIA35HAWXI3PWZVO/bundle.json","state":"https://pith.science/pith/FZFEHTR4VJDIA35HAWXI3PWZVO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FZFEHTR4VJDIA35HAWXI3PWZVO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:FZFEHTR4VJDIA35HAWXI3PWZVO","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":"d03f9f2ab5b6b37200bfac1558ab3e467c159677d277091becc792e76f29c404","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-03-10T17:35:11Z","title_canon_sha256":"1f32e2790d3129cb3ef30a4131f307024562283199bfe65398ac2c84620fc64a"},"schema_version":"1.0","source":{"id":"1103.2087","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1103.2087","created_at":"2026-05-18T04:27:03Z"},{"alias_kind":"arxiv_version","alias_value":"1103.2087v1","created_at":"2026-05-18T04:27:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1103.2087","created_at":"2026-05-18T04:27:03Z"},{"alias_kind":"pith_short_12","alias_value":"FZFEHTR4VJDI","created_at":"2026-05-18T12:26:28Z"},{"alias_kind":"pith_short_16","alias_value":"FZFEHTR4VJDIA35H","created_at":"2026-05-18T12:26:28Z"},{"alias_kind":"pith_short_8","alias_value":"FZFEHTR4","created_at":"2026-05-18T12:26:28Z"}],"graph_snapshots":[{"event_id":"sha256:56351775f44ea3f9b1ad7033d41ee6b20ade62b6e2391d1ea892198c31c362fc","target":"graph","created_at":"2026-05-18T04:27:03Z","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":"We investigate a graph parameter called the total vertex irregularity strength ($tvs(G)$), i.e. the minimal $s$ such that there is a labeling $w: E(G)\\cup V(G)\\rightarrow \\{1,2,..,s\\}$ of the edges and vertices of $G$ giving distinct weighted degrees $wt_G(v):=w(v)+\\sum_{v\\in e \\in E(G)}w(e)$ for every pair of vertices of $G$. We prove that $tvs(F)=\\lceil (n_1+1)/2 \\rceil$ for every forest $F$ with no vertices of degree 2 and no isolated vertices, where $n_1$ is the number of pendant vertices in $F$. Stronger results for trees were recently proved by Nurdin et al.","authors_text":"Florian Pfender, Marcin Anholcer, Micha{\\l} Karo\\'nski","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-03-10T17:35:11Z","title":"Total Vertex Irregularity Strength of Forests"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1103.2087","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:6dd67b3dbf33e361e5bb24a4589a84cd48c0f09856f8f96d3524e1996365e939","target":"record","created_at":"2026-05-18T04:27:03Z","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":"d03f9f2ab5b6b37200bfac1558ab3e467c159677d277091becc792e76f29c404","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-03-10T17:35:11Z","title_canon_sha256":"1f32e2790d3129cb3ef30a4131f307024562283199bfe65398ac2c84620fc64a"},"schema_version":"1.0","source":{"id":"1103.2087","kind":"arxiv","version":1}},"canonical_sha256":"2e4a43ce3caa46806fa705ae8dbed9aba549a99487ffe18c51d6b196b0a52754","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2e4a43ce3caa46806fa705ae8dbed9aba549a99487ffe18c51d6b196b0a52754","first_computed_at":"2026-05-18T04:27:03.013047Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:27:03.013047Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"VrIxSe3AlFAiGSVnsVi0ju0JlBm55h119jkkBOz6st2WBD9RPA/EEabKOM2vfL7U8YjwyJQEh23VynfjHeY1Dg==","signature_status":"signed_v1","signed_at":"2026-05-18T04:27:03.013731Z","signed_message":"canonical_sha256_bytes"},"source_id":"1103.2087","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6dd67b3dbf33e361e5bb24a4589a84cd48c0f09856f8f96d3524e1996365e939","sha256:56351775f44ea3f9b1ad7033d41ee6b20ade62b6e2391d1ea892198c31c362fc"],"state_sha256":"af0231476c21d0c540eceda0eb26bdcd9201c5374de1366c00432cde6387b280"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WTeo76ps0UeqgUjVdBqlGYW6WrgYTsTcXMLQbh8y9Uqf8ICkmSwbtSre/bVZwCAd5ssVyURR8lvsykDBBan5Ag==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T07:43:14.831256Z","bundle_sha256":"5a6f08ad791318764a81e232d34d39b8953dffeab4d06523ba417b0bb27ab9ad"}}