{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:J3FIR7NVQLT2JFIJGESWNLM3DG","short_pith_number":"pith:J3FIR7NV","schema_version":"1.0","canonical_sha256":"4eca88fdb582e7a49509312566ad9b198cd94c41742adc5a8fb7c02c0f3ca637","source":{"kind":"arxiv","id":"1403.6449","version":1},"attestation_state":"computed","paper":{"title":"Colouring multijoints","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Anthony Carbery, Stef\\'an Ingi Valdimarsson","submitted_at":"2014-03-25T18:40:12Z","abstract_excerpt":"Let L_1, ..., L_d be pairwise disjoint collections of lines in a d-dimensional vector space over some field. If the collections are sufficiently generic we prove that there exists a d-colouring of the set of multijoints J such that for each j, for each line in L_j, the number of points on it of colour j is O(|J|^{1/d})."},"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":"1403.6449","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-03-25T18:40:12Z","cross_cats_sorted":[],"title_canon_sha256":"4f7bf45be0b7a4ec63b12f191c5abcf347e37ccbc4a568e2224e4b9be27a725a","abstract_canon_sha256":"e6aed3a05ce40574e47830ee384df0e24f05e2f98c366239eb8b5fca2990654c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:55:36.873809Z","signature_b64":"g5PpUvcoOOiMGZVYI1YLkNILdC60YbkMmrW+6PF90o/quyNHjddw/BvRUkwf4Vl0azHfBtL81j8cBW8q7VaGAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4eca88fdb582e7a49509312566ad9b198cd94c41742adc5a8fb7c02c0f3ca637","last_reissued_at":"2026-05-18T02:55:36.873170Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:55:36.873170Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Colouring multijoints","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Anthony Carbery, Stef\\'an Ingi Valdimarsson","submitted_at":"2014-03-25T18:40:12Z","abstract_excerpt":"Let L_1, ..., L_d be pairwise disjoint collections of lines in a d-dimensional vector space over some field. If the collections are sufficiently generic we prove that there exists a d-colouring of the set of multijoints J such that for each j, for each line in L_j, the number of points on it of colour j is O(|J|^{1/d})."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1403.6449","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":"1403.6449","created_at":"2026-05-18T02:55:36.873295+00:00"},{"alias_kind":"arxiv_version","alias_value":"1403.6449v1","created_at":"2026-05-18T02:55:36.873295+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1403.6449","created_at":"2026-05-18T02:55:36.873295+00:00"},{"alias_kind":"pith_short_12","alias_value":"J3FIR7NVQLT2","created_at":"2026-05-18T12:28:33.132498+00:00"},{"alias_kind":"pith_short_16","alias_value":"J3FIR7NVQLT2JFIJ","created_at":"2026-05-18T12:28:33.132498+00:00"},{"alias_kind":"pith_short_8","alias_value":"J3FIR7NV","created_at":"2026-05-18T12:28:33.132498+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/J3FIR7NVQLT2JFIJGESWNLM3DG","json":"https://pith.science/pith/J3FIR7NVQLT2JFIJGESWNLM3DG.json","graph_json":"https://pith.science/api/pith-number/J3FIR7NVQLT2JFIJGESWNLM3DG/graph.json","events_json":"https://pith.science/api/pith-number/J3FIR7NVQLT2JFIJGESWNLM3DG/events.json","paper":"https://pith.science/paper/J3FIR7NV"},"agent_actions":{"view_html":"https://pith.science/pith/J3FIR7NVQLT2JFIJGESWNLM3DG","download_json":"https://pith.science/pith/J3FIR7NVQLT2JFIJGESWNLM3DG.json","view_paper":"https://pith.science/paper/J3FIR7NV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1403.6449&json=true","fetch_graph":"https://pith.science/api/pith-number/J3FIR7NVQLT2JFIJGESWNLM3DG/graph.json","fetch_events":"https://pith.science/api/pith-number/J3FIR7NVQLT2JFIJGESWNLM3DG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/J3FIR7NVQLT2JFIJGESWNLM3DG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/J3FIR7NVQLT2JFIJGESWNLM3DG/action/storage_attestation","attest_author":"https://pith.science/pith/J3FIR7NVQLT2JFIJGESWNLM3DG/action/author_attestation","sign_citation":"https://pith.science/pith/J3FIR7NVQLT2JFIJGESWNLM3DG/action/citation_signature","submit_replication":"https://pith.science/pith/J3FIR7NVQLT2JFIJGESWNLM3DG/action/replication_record"}},"created_at":"2026-05-18T02:55:36.873295+00:00","updated_at":"2026-05-18T02:55:36.873295+00:00"}