{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:67YDFBSNJ5NHTWAVT7ZHS22LCU","short_pith_number":"pith:67YDFBSN","schema_version":"1.0","canonical_sha256":"f7f032864d4f5a79d8159ff2796b4b152a7fd98191145ffa68028903c6064d97","source":{"kind":"arxiv","id":"1707.05148","version":1},"attestation_state":"computed","paper":{"title":"Note on group irregularity strength of disconnected graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Antoni Marczyk, Marcin Anholcer, Rafal Jura, Sylwia Cichacz","submitted_at":"2017-07-13T19:03:57Z","abstract_excerpt":"We investigate the \\textit{group irregularity strength} ($s_g(G)$) of graphs, i.e. the smallest value of $s$ such that taking any Abelian group $\\gr$ of order $s$, there exists a function $f:E(G)\\rightarrow \\gr$ such that the sums of edge labels at every vertex are distinct. So far it was not known if $s_g(G)$ is bounded for disconnected graphs. In the paper we we present some upper bound for all graphs. Moreover we give the exact values and bounds on $s_g(G)$ for disconnected graphs without a star as a component."},"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":"1707.05148","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-07-13T19:03:57Z","cross_cats_sorted":[],"title_canon_sha256":"d29a4237d902f2f4042d9e4368dd046d2a581d85519671c04a06cf878fde44c8","abstract_canon_sha256":"22872468a88075644b98d9547afc769f8edde23732aeba5903896d7298837feb"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:19:42.062944Z","signature_b64":"syFRgkY855wbkrRg+ZF231aqI59lgPc02+dKBM3om3e6MN12FjjGyclMS1mxZIQoV6W3qvrNYXWZ7xGmKB00BA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f7f032864d4f5a79d8159ff2796b4b152a7fd98191145ffa68028903c6064d97","last_reissued_at":"2026-05-18T00:19:42.062199Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:19:42.062199Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Note on group irregularity strength of disconnected graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Antoni Marczyk, Marcin Anholcer, Rafal Jura, Sylwia Cichacz","submitted_at":"2017-07-13T19:03:57Z","abstract_excerpt":"We investigate the \\textit{group irregularity strength} ($s_g(G)$) of graphs, i.e. the smallest value of $s$ such that taking any Abelian group $\\gr$ of order $s$, there exists a function $f:E(G)\\rightarrow \\gr$ such that the sums of edge labels at every vertex are distinct. So far it was not known if $s_g(G)$ is bounded for disconnected graphs. In the paper we we present some upper bound for all graphs. Moreover we give the exact values and bounds on $s_g(G)$ for disconnected graphs without a star as a component."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.05148","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":"1707.05148","created_at":"2026-05-18T00:19:42.062331+00:00"},{"alias_kind":"arxiv_version","alias_value":"1707.05148v1","created_at":"2026-05-18T00:19:42.062331+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.05148","created_at":"2026-05-18T00:19:42.062331+00:00"},{"alias_kind":"pith_short_12","alias_value":"67YDFBSNJ5NH","created_at":"2026-05-18T12:31:03.183658+00:00"},{"alias_kind":"pith_short_16","alias_value":"67YDFBSNJ5NHTWAV","created_at":"2026-05-18T12:31:03.183658+00:00"},{"alias_kind":"pith_short_8","alias_value":"67YDFBSN","created_at":"2026-05-18T12:31:03.183658+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/67YDFBSNJ5NHTWAVT7ZHS22LCU","json":"https://pith.science/pith/67YDFBSNJ5NHTWAVT7ZHS22LCU.json","graph_json":"https://pith.science/api/pith-number/67YDFBSNJ5NHTWAVT7ZHS22LCU/graph.json","events_json":"https://pith.science/api/pith-number/67YDFBSNJ5NHTWAVT7ZHS22LCU/events.json","paper":"https://pith.science/paper/67YDFBSN"},"agent_actions":{"view_html":"https://pith.science/pith/67YDFBSNJ5NHTWAVT7ZHS22LCU","download_json":"https://pith.science/pith/67YDFBSNJ5NHTWAVT7ZHS22LCU.json","view_paper":"https://pith.science/paper/67YDFBSN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1707.05148&json=true","fetch_graph":"https://pith.science/api/pith-number/67YDFBSNJ5NHTWAVT7ZHS22LCU/graph.json","fetch_events":"https://pith.science/api/pith-number/67YDFBSNJ5NHTWAVT7ZHS22LCU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/67YDFBSNJ5NHTWAVT7ZHS22LCU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/67YDFBSNJ5NHTWAVT7ZHS22LCU/action/storage_attestation","attest_author":"https://pith.science/pith/67YDFBSNJ5NHTWAVT7ZHS22LCU/action/author_attestation","sign_citation":"https://pith.science/pith/67YDFBSNJ5NHTWAVT7ZHS22LCU/action/citation_signature","submit_replication":"https://pith.science/pith/67YDFBSNJ5NHTWAVT7ZHS22LCU/action/replication_record"}},"created_at":"2026-05-18T00:19:42.062331+00:00","updated_at":"2026-05-18T00:19:42.062331+00:00"}