{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:OI4JGVLFLLKWAXRWZROU4VAIFH","short_pith_number":"pith:OI4JGVLF","schema_version":"1.0","canonical_sha256":"72389355655ad5605e36cc5d4e540829ce599d850a84c88c343d0eccfce06660","source":{"kind":"arxiv","id":"1310.4330","version":1},"attestation_state":"computed","paper":{"title":"Anti-Ramsey numbers of small graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Arie Bialostocki, Shoni Gilboa, Yehuda Roditty","submitted_at":"2013-10-16T11:06:48Z","abstract_excerpt":"The anti-Ramsey number $AR(n,G$), for a graph $G$ and an integer $n\\geq|V(G)|$, is defined to be the minimal integer $r$ such that in any edge-colouring of $K_n$ by at least $r$ colours there is a multicoloured copy of $G$, namely, a copy of $G$ whose edges have distinct colours. In this paper we determine the anti-Ramsey numbers of all graphs having at most four edges."},"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":"1310.4330","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-10-16T11:06:48Z","cross_cats_sorted":[],"title_canon_sha256":"51ded5adf4a032ebef7e60ee48d9c54f174b090a773c532f3233269856694d14","abstract_canon_sha256":"bef2c2c419f53f980cf27919db16d64a20c5d3d44d857ec905aa1989d40ca55e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:48:55.399834Z","signature_b64":"y/MCpWwJL4s51IXtAVVZ493VFRTYXMOP9+S84olBI6YvpWsFKMATmIpUmHdFOe7p/0GAcCQNKxcar+sLSwQjAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"72389355655ad5605e36cc5d4e540829ce599d850a84c88c343d0eccfce06660","last_reissued_at":"2026-05-18T00:48:55.399217Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:48:55.399217Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Anti-Ramsey numbers of small graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Arie Bialostocki, Shoni Gilboa, Yehuda Roditty","submitted_at":"2013-10-16T11:06:48Z","abstract_excerpt":"The anti-Ramsey number $AR(n,G$), for a graph $G$ and an integer $n\\geq|V(G)|$, is defined to be the minimal integer $r$ such that in any edge-colouring of $K_n$ by at least $r$ colours there is a multicoloured copy of $G$, namely, a copy of $G$ whose edges have distinct colours. In this paper we determine the anti-Ramsey numbers of all graphs having at most four edges."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1310.4330","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":"1310.4330","created_at":"2026-05-18T00:48:55.399289+00:00"},{"alias_kind":"arxiv_version","alias_value":"1310.4330v1","created_at":"2026-05-18T00:48:55.399289+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1310.4330","created_at":"2026-05-18T00:48:55.399289+00:00"},{"alias_kind":"pith_short_12","alias_value":"OI4JGVLFLLKW","created_at":"2026-05-18T12:27:54.935989+00:00"},{"alias_kind":"pith_short_16","alias_value":"OI4JGVLFLLKWAXRW","created_at":"2026-05-18T12:27:54.935989+00:00"},{"alias_kind":"pith_short_8","alias_value":"OI4JGVLF","created_at":"2026-05-18T12:27:54.935989+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/OI4JGVLFLLKWAXRWZROU4VAIFH","json":"https://pith.science/pith/OI4JGVLFLLKWAXRWZROU4VAIFH.json","graph_json":"https://pith.science/api/pith-number/OI4JGVLFLLKWAXRWZROU4VAIFH/graph.json","events_json":"https://pith.science/api/pith-number/OI4JGVLFLLKWAXRWZROU4VAIFH/events.json","paper":"https://pith.science/paper/OI4JGVLF"},"agent_actions":{"view_html":"https://pith.science/pith/OI4JGVLFLLKWAXRWZROU4VAIFH","download_json":"https://pith.science/pith/OI4JGVLFLLKWAXRWZROU4VAIFH.json","view_paper":"https://pith.science/paper/OI4JGVLF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1310.4330&json=true","fetch_graph":"https://pith.science/api/pith-number/OI4JGVLFLLKWAXRWZROU4VAIFH/graph.json","fetch_events":"https://pith.science/api/pith-number/OI4JGVLFLLKWAXRWZROU4VAIFH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OI4JGVLFLLKWAXRWZROU4VAIFH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OI4JGVLFLLKWAXRWZROU4VAIFH/action/storage_attestation","attest_author":"https://pith.science/pith/OI4JGVLFLLKWAXRWZROU4VAIFH/action/author_attestation","sign_citation":"https://pith.science/pith/OI4JGVLFLLKWAXRWZROU4VAIFH/action/citation_signature","submit_replication":"https://pith.science/pith/OI4JGVLFLLKWAXRWZROU4VAIFH/action/replication_record"}},"created_at":"2026-05-18T00:48:55.399289+00:00","updated_at":"2026-05-18T00:48:55.399289+00:00"}