{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:QP3LZBRBEA6LVKYSHAHYOUDQH4","short_pith_number":"pith:QP3LZBRB","schema_version":"1.0","canonical_sha256":"83f6bc8621203cbaab12380f8750703f0678e2c0e8bcd1d7d68f1080688a5d9c","source":{"kind":"arxiv","id":"1309.0259","version":3},"attestation_state":"computed","paper":{"title":"Graph Labeling with Distance Conditions and the Delta Squared Conjecture","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Cole Franks","submitted_at":"2013-09-01T20:23:11Z","abstract_excerpt":"We give bounds on the L(2,1)-labeling number of a simple graph in terms of its order and its maximum degree. We also describe an infinite class of graphs of which the elements have the highest L(2,1)-labeling numbers in terms of their maximum degrees of any known infinite class of graphs."},"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":"1309.0259","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-09-01T20:23:11Z","cross_cats_sorted":[],"title_canon_sha256":"45f095a40428e47a2e9918aa8eddb5228c862955b13a673f52b0e3b77fbcf1a0","abstract_canon_sha256":"0e51d817a4e0f9fb689e454184c2803663a1a49815cb452b10c68c8644788f21"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:07:44.153599Z","signature_b64":"5vLZCIRRkyu3lROuWhWfNfU4aDmk6M3IsxbDOlelvpeA6+v94YObT3WfKeJZIA0IDoAOOxVaH5GoFAiqk1RhCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"83f6bc8621203cbaab12380f8750703f0678e2c0e8bcd1d7d68f1080688a5d9c","last_reissued_at":"2026-05-18T03:07:44.153108Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:07:44.153108Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Graph Labeling with Distance Conditions and the Delta Squared Conjecture","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Cole Franks","submitted_at":"2013-09-01T20:23:11Z","abstract_excerpt":"We give bounds on the L(2,1)-labeling number of a simple graph in terms of its order and its maximum degree. We also describe an infinite class of graphs of which the elements have the highest L(2,1)-labeling numbers in terms of their maximum degrees of any known infinite class of graphs."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1309.0259","kind":"arxiv","version":3},"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":"1309.0259","created_at":"2026-05-18T03:07:44.153186+00:00"},{"alias_kind":"arxiv_version","alias_value":"1309.0259v3","created_at":"2026-05-18T03:07:44.153186+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1309.0259","created_at":"2026-05-18T03:07:44.153186+00:00"},{"alias_kind":"pith_short_12","alias_value":"QP3LZBRBEA6L","created_at":"2026-05-18T12:27:57.521954+00:00"},{"alias_kind":"pith_short_16","alias_value":"QP3LZBRBEA6LVKYS","created_at":"2026-05-18T12:27:57.521954+00:00"},{"alias_kind":"pith_short_8","alias_value":"QP3LZBRB","created_at":"2026-05-18T12:27:57.521954+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/QP3LZBRBEA6LVKYSHAHYOUDQH4","json":"https://pith.science/pith/QP3LZBRBEA6LVKYSHAHYOUDQH4.json","graph_json":"https://pith.science/api/pith-number/QP3LZBRBEA6LVKYSHAHYOUDQH4/graph.json","events_json":"https://pith.science/api/pith-number/QP3LZBRBEA6LVKYSHAHYOUDQH4/events.json","paper":"https://pith.science/paper/QP3LZBRB"},"agent_actions":{"view_html":"https://pith.science/pith/QP3LZBRBEA6LVKYSHAHYOUDQH4","download_json":"https://pith.science/pith/QP3LZBRBEA6LVKYSHAHYOUDQH4.json","view_paper":"https://pith.science/paper/QP3LZBRB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1309.0259&json=true","fetch_graph":"https://pith.science/api/pith-number/QP3LZBRBEA6LVKYSHAHYOUDQH4/graph.json","fetch_events":"https://pith.science/api/pith-number/QP3LZBRBEA6LVKYSHAHYOUDQH4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QP3LZBRBEA6LVKYSHAHYOUDQH4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QP3LZBRBEA6LVKYSHAHYOUDQH4/action/storage_attestation","attest_author":"https://pith.science/pith/QP3LZBRBEA6LVKYSHAHYOUDQH4/action/author_attestation","sign_citation":"https://pith.science/pith/QP3LZBRBEA6LVKYSHAHYOUDQH4/action/citation_signature","submit_replication":"https://pith.science/pith/QP3LZBRBEA6LVKYSHAHYOUDQH4/action/replication_record"}},"created_at":"2026-05-18T03:07:44.153186+00:00","updated_at":"2026-05-18T03:07:44.153186+00:00"}