{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:HT3RUKUAXZODKJONGMSDAU6LSF","short_pith_number":"pith:HT3RUKUA","schema_version":"1.0","canonical_sha256":"3cf71a2a80be5c3525cd33243053cb915134e267b0336b833c353ea207074e1d","source":{"kind":"arxiv","id":"1205.3266","version":1},"attestation_state":"computed","paper":{"title":"On the 1-2-3-conjecture","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Akbar Davoodi, Behnaz Omoomi","submitted_at":"2012-05-15T05:55:30Z","abstract_excerpt":"A k-edge-weighting of a graph G is a function w: E(G)->{1,2,...,k}. An edge-weighting naturally induces a vertex coloring c, where for every vertex v in V(G), c(v) is sum of weights of the edges that are adjacent to vertex v. If the induced coloring c is a proper vertex coloring, then w is called a vertex-coloring k-edge weighting (VCk-EW). Karonski et al. (J. Combin. Theory Ser. B 91 (2004) 151-157) conjectured that every graph admits a VC3-EW. This conjecture is known as 1-2-3-conjecture. In this paper, frst, we study the vertex-coloring edge-weighting of the cartesian product of graphs. Amo"},"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":"1205.3266","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-05-15T05:55:30Z","cross_cats_sorted":[],"title_canon_sha256":"85005102a81a15905700c358cdf55f0cae6857e57573c90a3463b9595b21c26c","abstract_canon_sha256":"90227bf25f93a09ad95ab4f91e137ff98083b5979892b3203718469ddc508e6f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:55:36.463876Z","signature_b64":"hJ6iLBls3J9hqSYHSxjHWaP2xJqSIc/wPbWNpAiKqaBolXZqQVCmQJjyrqnPwlXkWDt0K6f/e0bOCS5kxf2YDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3cf71a2a80be5c3525cd33243053cb915134e267b0336b833c353ea207074e1d","last_reissued_at":"2026-05-18T03:55:36.463228Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:55:36.463228Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the 1-2-3-conjecture","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Akbar Davoodi, Behnaz Omoomi","submitted_at":"2012-05-15T05:55:30Z","abstract_excerpt":"A k-edge-weighting of a graph G is a function w: E(G)->{1,2,...,k}. An edge-weighting naturally induces a vertex coloring c, where for every vertex v in V(G), c(v) is sum of weights of the edges that are adjacent to vertex v. If the induced coloring c is a proper vertex coloring, then w is called a vertex-coloring k-edge weighting (VCk-EW). Karonski et al. (J. Combin. Theory Ser. B 91 (2004) 151-157) conjectured that every graph admits a VC3-EW. This conjecture is known as 1-2-3-conjecture. In this paper, frst, we study the vertex-coloring edge-weighting of the cartesian product of graphs. Amo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1205.3266","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":"1205.3266","created_at":"2026-05-18T03:55:36.463330+00:00"},{"alias_kind":"arxiv_version","alias_value":"1205.3266v1","created_at":"2026-05-18T03:55:36.463330+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1205.3266","created_at":"2026-05-18T03:55:36.463330+00:00"},{"alias_kind":"pith_short_12","alias_value":"HT3RUKUAXZOD","created_at":"2026-05-18T12:27:09.501522+00:00"},{"alias_kind":"pith_short_16","alias_value":"HT3RUKUAXZODKJON","created_at":"2026-05-18T12:27:09.501522+00:00"},{"alias_kind":"pith_short_8","alias_value":"HT3RUKUA","created_at":"2026-05-18T12:27:09.501522+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/HT3RUKUAXZODKJONGMSDAU6LSF","json":"https://pith.science/pith/HT3RUKUAXZODKJONGMSDAU6LSF.json","graph_json":"https://pith.science/api/pith-number/HT3RUKUAXZODKJONGMSDAU6LSF/graph.json","events_json":"https://pith.science/api/pith-number/HT3RUKUAXZODKJONGMSDAU6LSF/events.json","paper":"https://pith.science/paper/HT3RUKUA"},"agent_actions":{"view_html":"https://pith.science/pith/HT3RUKUAXZODKJONGMSDAU6LSF","download_json":"https://pith.science/pith/HT3RUKUAXZODKJONGMSDAU6LSF.json","view_paper":"https://pith.science/paper/HT3RUKUA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1205.3266&json=true","fetch_graph":"https://pith.science/api/pith-number/HT3RUKUAXZODKJONGMSDAU6LSF/graph.json","fetch_events":"https://pith.science/api/pith-number/HT3RUKUAXZODKJONGMSDAU6LSF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HT3RUKUAXZODKJONGMSDAU6LSF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HT3RUKUAXZODKJONGMSDAU6LSF/action/storage_attestation","attest_author":"https://pith.science/pith/HT3RUKUAXZODKJONGMSDAU6LSF/action/author_attestation","sign_citation":"https://pith.science/pith/HT3RUKUAXZODKJONGMSDAU6LSF/action/citation_signature","submit_replication":"https://pith.science/pith/HT3RUKUAXZODKJONGMSDAU6LSF/action/replication_record"}},"created_at":"2026-05-18T03:55:36.463330+00:00","updated_at":"2026-05-18T03:55:36.463330+00:00"}