{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:M6LG5BTRNXJAPIHVDS3E7WSJE3","short_pith_number":"pith:M6LG5BTR","schema_version":"1.0","canonical_sha256":"67966e86716dd207a0f51cb64fda4926d6b0b96df6e9136a60fd38c746a02a84","source":{"kind":"arxiv","id":"1303.3198","version":2},"attestation_state":"computed","paper":{"title":"1,2,3-Conjecture and 1,2-Conjecture for Sparse Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Daniel W. Cranston, Douglas B. West, Sogol Jahanbekam","submitted_at":"2013-03-13T16:04:43Z","abstract_excerpt":"We apply the Discharging Method to prove the 1,2,3-Conjecture and the 1,2-Conjecture for graphs with maximum average degree less than 8/3. Stronger results on these conjectures have been proved, but this is the first application of discharging to them, and the structure theorems and reducibility results are of independent interest."},"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":"1303.3198","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-03-13T16:04:43Z","cross_cats_sorted":[],"title_canon_sha256":"1e3474ab223ec4c3a493be4b5586cd75801993dbd18171f623bed173ea21ec40","abstract_canon_sha256":"8eb7e92679cbb93fbf76ae44c81de682056629c5b3adebbe301c17197f69c119"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:35:53.020955Z","signature_b64":"SBkzpoIZis3o8FjI9WGytMDNj+PRtuO+YWEK7LK03+lMW//CX89afl7oNy8zDdiIUuDdC83uAkAtbvuVeTsMDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"67966e86716dd207a0f51cb64fda4926d6b0b96df6e9136a60fd38c746a02a84","last_reissued_at":"2026-05-18T01:35:53.020374Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:35:53.020374Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"1,2,3-Conjecture and 1,2-Conjecture for Sparse Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Daniel W. Cranston, Douglas B. West, Sogol Jahanbekam","submitted_at":"2013-03-13T16:04:43Z","abstract_excerpt":"We apply the Discharging Method to prove the 1,2,3-Conjecture and the 1,2-Conjecture for graphs with maximum average degree less than 8/3. Stronger results on these conjectures have been proved, but this is the first application of discharging to them, and the structure theorems and reducibility results are of independent interest."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1303.3198","kind":"arxiv","version":2},"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":"1303.3198","created_at":"2026-05-18T01:35:53.020469+00:00"},{"alias_kind":"arxiv_version","alias_value":"1303.3198v2","created_at":"2026-05-18T01:35:53.020469+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1303.3198","created_at":"2026-05-18T01:35:53.020469+00:00"},{"alias_kind":"pith_short_12","alias_value":"M6LG5BTRNXJA","created_at":"2026-05-18T12:27:51.066281+00:00"},{"alias_kind":"pith_short_16","alias_value":"M6LG5BTRNXJAPIHV","created_at":"2026-05-18T12:27:51.066281+00:00"},{"alias_kind":"pith_short_8","alias_value":"M6LG5BTR","created_at":"2026-05-18T12:27:51.066281+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/M6LG5BTRNXJAPIHVDS3E7WSJE3","json":"https://pith.science/pith/M6LG5BTRNXJAPIHVDS3E7WSJE3.json","graph_json":"https://pith.science/api/pith-number/M6LG5BTRNXJAPIHVDS3E7WSJE3/graph.json","events_json":"https://pith.science/api/pith-number/M6LG5BTRNXJAPIHVDS3E7WSJE3/events.json","paper":"https://pith.science/paper/M6LG5BTR"},"agent_actions":{"view_html":"https://pith.science/pith/M6LG5BTRNXJAPIHVDS3E7WSJE3","download_json":"https://pith.science/pith/M6LG5BTRNXJAPIHVDS3E7WSJE3.json","view_paper":"https://pith.science/paper/M6LG5BTR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1303.3198&json=true","fetch_graph":"https://pith.science/api/pith-number/M6LG5BTRNXJAPIHVDS3E7WSJE3/graph.json","fetch_events":"https://pith.science/api/pith-number/M6LG5BTRNXJAPIHVDS3E7WSJE3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/M6LG5BTRNXJAPIHVDS3E7WSJE3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/M6LG5BTRNXJAPIHVDS3E7WSJE3/action/storage_attestation","attest_author":"https://pith.science/pith/M6LG5BTRNXJAPIHVDS3E7WSJE3/action/author_attestation","sign_citation":"https://pith.science/pith/M6LG5BTRNXJAPIHVDS3E7WSJE3/action/citation_signature","submit_replication":"https://pith.science/pith/M6LG5BTRNXJAPIHVDS3E7WSJE3/action/replication_record"}},"created_at":"2026-05-18T01:35:53.020469+00:00","updated_at":"2026-05-18T01:35:53.020469+00:00"}