{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:CU5NECIQHGAEFAAY467INAEONV","short_pith_number":"pith:CU5NECIQ","schema_version":"1.0","canonical_sha256":"153ad209103980428018e7be86808e6d44158cca777d8ac833b984e46206217e","source":{"kind":"arxiv","id":"2307.15380","version":3},"attestation_state":"computed","paper":{"title":"Tight Bound and Structural Theorem for Joints","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Hung-Hsun Hans Yu, Ting-Wei Chao","submitted_at":"2023-07-28T08:03:58Z","abstract_excerpt":"A joint of a set of lines $\\mathcal{L}$ in $\\mathbb{F}^d$ is a point that is contained in $d$ lines with linearly independent directions. The joints problem asks for the maximum number of joints that are formed by $L$ lines. Guth and Katz showed that the number of joints is at most $O(L^{3/2})$ in $\\mathbb{R}^3$ using polynomial method. This upper bound is met by the construction given by taking the joints and the lines to be all the $d$-wise intersections and all the $(d-1)$-wise intersections of $M$ hyperplanes in general position. Furthermore, this construction is conjectured to be optimal."},"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":"2307.15380","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"math.CO","submitted_at":"2023-07-28T08:03:58Z","cross_cats_sorted":[],"title_canon_sha256":"43ab7a613a8b339096fdabe114bd5598791154bab45b489d5fc8f24f0d9db9fb","abstract_canon_sha256":"62a8502f4bd3625cae82f4b7a4d9cfcd5ec19ad898d1a71649e9e8bea7a61343"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:27:07.302009Z","signature_b64":"86bbWwri3cLr24AtG3lIVVZITKZC9zqYP2uFFxoTHyft8uzWyV5rcGgqdhG7x3ixj3aXBUZyyxHwce884bVMCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"153ad209103980428018e7be86808e6d44158cca777d8ac833b984e46206217e","last_reissued_at":"2026-07-05T07:27:07.301469Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:27:07.301469Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Tight Bound and Structural Theorem for Joints","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Hung-Hsun Hans Yu, Ting-Wei Chao","submitted_at":"2023-07-28T08:03:58Z","abstract_excerpt":"A joint of a set of lines $\\mathcal{L}$ in $\\mathbb{F}^d$ is a point that is contained in $d$ lines with linearly independent directions. The joints problem asks for the maximum number of joints that are formed by $L$ lines. Guth and Katz showed that the number of joints is at most $O(L^{3/2})$ in $\\mathbb{R}^3$ using polynomial method. This upper bound is met by the construction given by taking the joints and the lines to be all the $d$-wise intersections and all the $(d-1)$-wise intersections of $M$ hyperplanes in general position. Furthermore, this construction is conjectured to be optimal."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2307.15380","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2307.15380/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2307.15380","created_at":"2026-07-05T07:27:07.301537+00:00"},{"alias_kind":"arxiv_version","alias_value":"2307.15380v3","created_at":"2026-07-05T07:27:07.301537+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2307.15380","created_at":"2026-07-05T07:27:07.301537+00:00"},{"alias_kind":"pith_short_12","alias_value":"CU5NECIQHGAE","created_at":"2026-07-05T07:27:07.301537+00:00"},{"alias_kind":"pith_short_16","alias_value":"CU5NECIQHGAEFAAY","created_at":"2026-07-05T07:27:07.301537+00:00"},{"alias_kind":"pith_short_8","alias_value":"CU5NECIQ","created_at":"2026-07-05T07:27:07.301537+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2501.13850","citing_title":"Uniform set systems with small VC-dimension","ref_index":5,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/CU5NECIQHGAEFAAY467INAEONV","json":"https://pith.science/pith/CU5NECIQHGAEFAAY467INAEONV.json","graph_json":"https://pith.science/api/pith-number/CU5NECIQHGAEFAAY467INAEONV/graph.json","events_json":"https://pith.science/api/pith-number/CU5NECIQHGAEFAAY467INAEONV/events.json","paper":"https://pith.science/paper/CU5NECIQ"},"agent_actions":{"view_html":"https://pith.science/pith/CU5NECIQHGAEFAAY467INAEONV","download_json":"https://pith.science/pith/CU5NECIQHGAEFAAY467INAEONV.json","view_paper":"https://pith.science/paper/CU5NECIQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2307.15380&json=true","fetch_graph":"https://pith.science/api/pith-number/CU5NECIQHGAEFAAY467INAEONV/graph.json","fetch_events":"https://pith.science/api/pith-number/CU5NECIQHGAEFAAY467INAEONV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CU5NECIQHGAEFAAY467INAEONV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CU5NECIQHGAEFAAY467INAEONV/action/storage_attestation","attest_author":"https://pith.science/pith/CU5NECIQHGAEFAAY467INAEONV/action/author_attestation","sign_citation":"https://pith.science/pith/CU5NECIQHGAEFAAY467INAEONV/action/citation_signature","submit_replication":"https://pith.science/pith/CU5NECIQHGAEFAAY467INAEONV/action/replication_record"}},"created_at":"2026-07-05T07:27:07.301537+00:00","updated_at":"2026-07-05T07:27:07.301537+00:00"}