{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:FZFEHTR4VJDIA35HAWXI3PWZVO","short_pith_number":"pith:FZFEHTR4","schema_version":"1.0","canonical_sha256":"2e4a43ce3caa46806fa705ae8dbed9aba549a99487ffe18c51d6b196b0a52754","source":{"kind":"arxiv","id":"1103.2087","version":1},"attestation_state":"computed","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."},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1103.2087","created_at":"2026-05-18T04:27:03.013158+00:00"},{"alias_kind":"arxiv_version","alias_value":"1103.2087v1","created_at":"2026-05-18T04:27:03.013158+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1103.2087","created_at":"2026-05-18T04:27:03.013158+00:00"},{"alias_kind":"pith_short_12","alias_value":"FZFEHTR4VJDI","created_at":"2026-05-18T12:26:28.662955+00:00"},{"alias_kind":"pith_short_16","alias_value":"FZFEHTR4VJDIA35H","created_at":"2026-05-18T12:26:28.662955+00:00"},{"alias_kind":"pith_short_8","alias_value":"FZFEHTR4","created_at":"2026-05-18T12:26:28.662955+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/FZFEHTR4VJDIA35HAWXI3PWZVO","json":"https://pith.science/pith/FZFEHTR4VJDIA35HAWXI3PWZVO.json","graph_json":"https://pith.science/api/pith-number/FZFEHTR4VJDIA35HAWXI3PWZVO/graph.json","events_json":"https://pith.science/api/pith-number/FZFEHTR4VJDIA35HAWXI3PWZVO/events.json","paper":"https://pith.science/paper/FZFEHTR4"},"agent_actions":{"view_html":"https://pith.science/pith/FZFEHTR4VJDIA35HAWXI3PWZVO","download_json":"https://pith.science/pith/FZFEHTR4VJDIA35HAWXI3PWZVO.json","view_paper":"https://pith.science/paper/FZFEHTR4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1103.2087&json=true","fetch_graph":"https://pith.science/api/pith-number/FZFEHTR4VJDIA35HAWXI3PWZVO/graph.json","fetch_events":"https://pith.science/api/pith-number/FZFEHTR4VJDIA35HAWXI3PWZVO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FZFEHTR4VJDIA35HAWXI3PWZVO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FZFEHTR4VJDIA35HAWXI3PWZVO/action/storage_attestation","attest_author":"https://pith.science/pith/FZFEHTR4VJDIA35HAWXI3PWZVO/action/author_attestation","sign_citation":"https://pith.science/pith/FZFEHTR4VJDIA35HAWXI3PWZVO/action/citation_signature","submit_replication":"https://pith.science/pith/FZFEHTR4VJDIA35HAWXI3PWZVO/action/replication_record"}},"created_at":"2026-05-18T04:27:03.013158+00:00","updated_at":"2026-05-18T04:27:03.013158+00:00"}