{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:OEXJN7JQD4NXQZUYZULIYLARCU","short_pith_number":"pith:OEXJN7JQ","schema_version":"1.0","canonical_sha256":"712e96fd301f1b786698cd168c2c11151226cd3f2939768a6c22b2eca410f9ab","source":{"kind":"arxiv","id":"1211.5122","version":1},"attestation_state":"computed","paper":{"title":"The 1-2-3 Conjecture and related problems: a survey","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Ben Seamone","submitted_at":"2012-11-21T19:37:42Z","abstract_excerpt":"The 1-2-3 Conjecture, posed in 2004 by Karonski, Luczak, and Thomason, is as follows: \"If G is a graph with no connected component having exactly 2 vertices, then the edges of G may be assigned weights from the set {1,2,3} so that, for any adjacent vertices u and v, the sum of weights of edges incident to u differs from the sum of weights of edges incident to v.\" This survey paper presents the current state of research on the 1-2-3 Conjecture and the many variants that have been proposed in its short but active history."},"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":"1211.5122","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-11-21T19:37:42Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"039bcc2cfaf1a1aee8957299811b1dfeab9a7da297a4cff0e718312bcb523245","abstract_canon_sha256":"2d960551bd852bc98a4017cbb4306c38096a0da2b4041ce0986a7d842734fcbc"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:40:14.989264Z","signature_b64":"UhBgGQtjN/Dm+XwCpxuXEr198kTPY+QNoDaVWkNBIPtAmgDtycpcKKszFTiz4l2GtZQzLKfIxidvadSiSsqvCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"712e96fd301f1b786698cd168c2c11151226cd3f2939768a6c22b2eca410f9ab","last_reissued_at":"2026-05-18T03:40:14.988744Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:40:14.988744Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The 1-2-3 Conjecture and related problems: a survey","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Ben Seamone","submitted_at":"2012-11-21T19:37:42Z","abstract_excerpt":"The 1-2-3 Conjecture, posed in 2004 by Karonski, Luczak, and Thomason, is as follows: \"If G is a graph with no connected component having exactly 2 vertices, then the edges of G may be assigned weights from the set {1,2,3} so that, for any adjacent vertices u and v, the sum of weights of edges incident to u differs from the sum of weights of edges incident to v.\" This survey paper presents the current state of research on the 1-2-3 Conjecture and the many variants that have been proposed in its short but active history."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1211.5122","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":"1211.5122","created_at":"2026-05-18T03:40:14.988820+00:00"},{"alias_kind":"arxiv_version","alias_value":"1211.5122v1","created_at":"2026-05-18T03:40:14.988820+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1211.5122","created_at":"2026-05-18T03:40:14.988820+00:00"},{"alias_kind":"pith_short_12","alias_value":"OEXJN7JQD4NX","created_at":"2026-05-18T12:27:16.716162+00:00"},{"alias_kind":"pith_short_16","alias_value":"OEXJN7JQD4NXQZUY","created_at":"2026-05-18T12:27:16.716162+00:00"},{"alias_kind":"pith_short_8","alias_value":"OEXJN7JQ","created_at":"2026-05-18T12:27:16.716162+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2203.11521","citing_title":"Neighbour sum distinguishing edge-weightings with local constraints","ref_index":17,"is_internal_anchor":true},{"citing_arxiv_id":"2604.12363","citing_title":"The Parameterized Complexity of Vertex-Coloring Edge-Weighting","ref_index":11,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/OEXJN7JQD4NXQZUYZULIYLARCU","json":"https://pith.science/pith/OEXJN7JQD4NXQZUYZULIYLARCU.json","graph_json":"https://pith.science/api/pith-number/OEXJN7JQD4NXQZUYZULIYLARCU/graph.json","events_json":"https://pith.science/api/pith-number/OEXJN7JQD4NXQZUYZULIYLARCU/events.json","paper":"https://pith.science/paper/OEXJN7JQ"},"agent_actions":{"view_html":"https://pith.science/pith/OEXJN7JQD4NXQZUYZULIYLARCU","download_json":"https://pith.science/pith/OEXJN7JQD4NXQZUYZULIYLARCU.json","view_paper":"https://pith.science/paper/OEXJN7JQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1211.5122&json=true","fetch_graph":"https://pith.science/api/pith-number/OEXJN7JQD4NXQZUYZULIYLARCU/graph.json","fetch_events":"https://pith.science/api/pith-number/OEXJN7JQD4NXQZUYZULIYLARCU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OEXJN7JQD4NXQZUYZULIYLARCU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OEXJN7JQD4NXQZUYZULIYLARCU/action/storage_attestation","attest_author":"https://pith.science/pith/OEXJN7JQD4NXQZUYZULIYLARCU/action/author_attestation","sign_citation":"https://pith.science/pith/OEXJN7JQD4NXQZUYZULIYLARCU/action/citation_signature","submit_replication":"https://pith.science/pith/OEXJN7JQD4NXQZUYZULIYLARCU/action/replication_record"}},"created_at":"2026-05-18T03:40:14.988820+00:00","updated_at":"2026-05-18T03:40:14.988820+00:00"}