{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:YYULJYH5BKGUAZALUXIITHDCXJ","short_pith_number":"pith:YYULJYH5","canonical_record":{"source":{"id":"1805.05204","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-05-14T14:54:00Z","cross_cats_sorted":[],"title_canon_sha256":"a47c9f9781c5b2dc123570b8ffea540e8735b13c6e685860272bb33ba9eaa662","abstract_canon_sha256":"da70ea511a302da2b2252510d3c0dcc94644aaf7d5edc2913b5c519401019b21"},"schema_version":"1.0"},"canonical_sha256":"c628b4e0fd0a8d40640ba5d0899c62ba640d20d43631de8736dad1faa4d0c209","source":{"kind":"arxiv","id":"1805.05204","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.05204","created_at":"2026-05-18T00:03:29Z"},{"alias_kind":"arxiv_version","alias_value":"1805.05204v1","created_at":"2026-05-18T00:03:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.05204","created_at":"2026-05-18T00:03:29Z"},{"alias_kind":"pith_short_12","alias_value":"YYULJYH5BKGU","created_at":"2026-05-18T12:33:04Z"},{"alias_kind":"pith_short_16","alias_value":"YYULJYH5BKGUAZAL","created_at":"2026-05-18T12:33:04Z"},{"alias_kind":"pith_short_8","alias_value":"YYULJYH5","created_at":"2026-05-18T12:33:04Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:YYULJYH5BKGUAZALUXIITHDCXJ","target":"record","payload":{"canonical_record":{"source":{"id":"1805.05204","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-05-14T14:54:00Z","cross_cats_sorted":[],"title_canon_sha256":"a47c9f9781c5b2dc123570b8ffea540e8735b13c6e685860272bb33ba9eaa662","abstract_canon_sha256":"da70ea511a302da2b2252510d3c0dcc94644aaf7d5edc2913b5c519401019b21"},"schema_version":"1.0"},"canonical_sha256":"c628b4e0fd0a8d40640ba5d0899c62ba640d20d43631de8736dad1faa4d0c209","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:03:29.285958Z","signature_b64":"tZfu1NSq3RxsxLtm/NaGBopkdqFxg8m4eObGe6Xlhxnu2M8Bu49kJ2H4zlMbvDB5ngZcvUmllOQJw2dgaNl5DA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c628b4e0fd0a8d40640ba5d0899c62ba640d20d43631de8736dad1faa4d0c209","last_reissued_at":"2026-05-18T00:03:29.285269Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:03:29.285269Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1805.05204","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:03:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qT2ddzvxjncAs18aHzPftBCoQcbgU8X+rxV0eO3N7g7TKxk0eqAr+iFlccdIt+C3S++qUzo9zK/q+K291kYBAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T17:47:58.792529Z"},"content_sha256":"5f3b21300e8196d3a4a7efb4fcab73cdfe2d2a9e4c0002847cf1a550917d4fe0","schema_version":"1.0","event_id":"sha256:5f3b21300e8196d3a4a7efb4fcab73cdfe2d2a9e4c0002847cf1a550917d4fe0"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:YYULJYH5BKGUAZALUXIITHDCXJ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Linear bounds on nowhere-zero group irregularity strength and nowhere-zero group sum chromatic number of graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Jakub Przyby{\\l}o, Marcin Anholcer, Sylwia Cichacz","submitted_at":"2018-05-14T14:54:00Z","abstract_excerpt":"We investigate the \\textit{group irregularity strength}, $s_g(G)$, of a graph, i.e. the least integer $k$ such that taking any Abelian group $\\mathcal{G}$ of order $k$, there exists a function $f:E(G)\\rightarrow \\mathcal{G}$ so that the sums of edge labels incident with every vertex are distinct. So far the best upper bound on $s_g(G)$ for a general graph $G$ was exponential in $n-c$, where $n$ is the order of $G$ and $c$ denotes the number of its components. In this note we prove that $s_g(G)$ is linear in $n$, namely not greater than $2n$. In fact, we prove a stronger result, as we additiona"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.05204","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:03:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Jpl6ELp6fVTjjorZdnMZw5zAS6HWkO/DJVqpT2UA2AogdQLX24isLvHEvp6N0E11DWyrthhmcfW3j4km5LehAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T17:47:58.792875Z"},"content_sha256":"a140ba6ccee1493942b78dba417d5a489b5ab0cc841f4f53003a802f55aed134","schema_version":"1.0","event_id":"sha256:a140ba6ccee1493942b78dba417d5a489b5ab0cc841f4f53003a802f55aed134"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/YYULJYH5BKGUAZALUXIITHDCXJ/bundle.json","state_url":"https://pith.science/pith/YYULJYH5BKGUAZALUXIITHDCXJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/YYULJYH5BKGUAZALUXIITHDCXJ/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-30T17:47:58Z","links":{"resolver":"https://pith.science/pith/YYULJYH5BKGUAZALUXIITHDCXJ","bundle":"https://pith.science/pith/YYULJYH5BKGUAZALUXIITHDCXJ/bundle.json","state":"https://pith.science/pith/YYULJYH5BKGUAZALUXIITHDCXJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/YYULJYH5BKGUAZALUXIITHDCXJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:YYULJYH5BKGUAZALUXIITHDCXJ","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":"da70ea511a302da2b2252510d3c0dcc94644aaf7d5edc2913b5c519401019b21","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-05-14T14:54:00Z","title_canon_sha256":"a47c9f9781c5b2dc123570b8ffea540e8735b13c6e685860272bb33ba9eaa662"},"schema_version":"1.0","source":{"id":"1805.05204","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.05204","created_at":"2026-05-18T00:03:29Z"},{"alias_kind":"arxiv_version","alias_value":"1805.05204v1","created_at":"2026-05-18T00:03:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.05204","created_at":"2026-05-18T00:03:29Z"},{"alias_kind":"pith_short_12","alias_value":"YYULJYH5BKGU","created_at":"2026-05-18T12:33:04Z"},{"alias_kind":"pith_short_16","alias_value":"YYULJYH5BKGUAZAL","created_at":"2026-05-18T12:33:04Z"},{"alias_kind":"pith_short_8","alias_value":"YYULJYH5","created_at":"2026-05-18T12:33:04Z"}],"graph_snapshots":[{"event_id":"sha256:a140ba6ccee1493942b78dba417d5a489b5ab0cc841f4f53003a802f55aed134","target":"graph","created_at":"2026-05-18T00:03:29Z","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 the \\textit{group irregularity strength}, $s_g(G)$, of a graph, i.e. the least integer $k$ such that taking any Abelian group $\\mathcal{G}$ of order $k$, there exists a function $f:E(G)\\rightarrow \\mathcal{G}$ so that the sums of edge labels incident with every vertex are distinct. So far the best upper bound on $s_g(G)$ for a general graph $G$ was exponential in $n-c$, where $n$ is the order of $G$ and $c$ denotes the number of its components. In this note we prove that $s_g(G)$ is linear in $n$, namely not greater than $2n$. In fact, we prove a stronger result, as we additiona","authors_text":"Jakub Przyby{\\l}o, Marcin Anholcer, Sylwia Cichacz","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-05-14T14:54:00Z","title":"Linear bounds on nowhere-zero group irregularity strength and nowhere-zero group sum chromatic number of graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.05204","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:5f3b21300e8196d3a4a7efb4fcab73cdfe2d2a9e4c0002847cf1a550917d4fe0","target":"record","created_at":"2026-05-18T00:03:29Z","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":"da70ea511a302da2b2252510d3c0dcc94644aaf7d5edc2913b5c519401019b21","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-05-14T14:54:00Z","title_canon_sha256":"a47c9f9781c5b2dc123570b8ffea540e8735b13c6e685860272bb33ba9eaa662"},"schema_version":"1.0","source":{"id":"1805.05204","kind":"arxiv","version":1}},"canonical_sha256":"c628b4e0fd0a8d40640ba5d0899c62ba640d20d43631de8736dad1faa4d0c209","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c628b4e0fd0a8d40640ba5d0899c62ba640d20d43631de8736dad1faa4d0c209","first_computed_at":"2026-05-18T00:03:29.285269Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:03:29.285269Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"tZfu1NSq3RxsxLtm/NaGBopkdqFxg8m4eObGe6Xlhxnu2M8Bu49kJ2H4zlMbvDB5ngZcvUmllOQJw2dgaNl5DA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:03:29.285958Z","signed_message":"canonical_sha256_bytes"},"source_id":"1805.05204","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5f3b21300e8196d3a4a7efb4fcab73cdfe2d2a9e4c0002847cf1a550917d4fe0","sha256:a140ba6ccee1493942b78dba417d5a489b5ab0cc841f4f53003a802f55aed134"],"state_sha256":"1d36b0710567e93216a5b79929096a8592640b9ba482d7c6dabb8b868fe4c87b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GfykQi14Hc8nFWO44HaYTSxYBOh0Sxq0tJfl/9CkuI8uRBZUUepgYKXpINg+Uy16AXhaK7m0pL6A0G5+f5aiBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T17:47:58.795175Z","bundle_sha256":"973c241f62cb6fb560522a49147f9a6d9d07288b880f8e513c16b3a658ac8c4f"}}