{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:7GA7VYM6K2AD6N6RIOVMB4ATM5","short_pith_number":"pith:7GA7VYM6","schema_version":"1.0","canonical_sha256":"f981fae19e56803f37d143aac0f013677b837ce5b403030f0e9ad5f744cfe4c6","source":{"kind":"arxiv","id":"1805.09888","version":2},"attestation_state":"computed","paper":{"title":"On crossing families of complete geometric graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Christian Rubio-Montiel, Dolores Lara","submitted_at":"2018-05-24T20:33:20Z","abstract_excerpt":"A crossing family is a collection of pairwise crossing segments, this concept was introduced by Aronov et. al. (1994). They prove that any set of $n$ points (in general position) in the plain contains a crossing family of size $\\sqrt{n/12}$. In this paper we present a generalization of the concept and give several results regarding this generalization."},"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":"1805.09888","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-05-24T20:33:20Z","cross_cats_sorted":[],"title_canon_sha256":"5e734c2b30ae3ef90a7565663687d42599fe15c570510228805a9d87cf4a8a09","abstract_canon_sha256":"e9574ee3501ae7d8117aa054a6601a0302b00692c4251d0924e04fff21aa941b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:49:22.462753Z","signature_b64":"1gt4Mr2ClJ109Pv7hfbSGbuzEzJx+F4iTFolwNwGTFlxV1RH+Pw8zarzSFQGsASVeQeVZCNjA8Tlgw4y20+0CA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f981fae19e56803f37d143aac0f013677b837ce5b403030f0e9ad5f744cfe4c6","last_reissued_at":"2026-05-17T23:49:22.462101Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:49:22.462101Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On crossing families of complete geometric graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Christian Rubio-Montiel, Dolores Lara","submitted_at":"2018-05-24T20:33:20Z","abstract_excerpt":"A crossing family is a collection of pairwise crossing segments, this concept was introduced by Aronov et. al. (1994). They prove that any set of $n$ points (in general position) in the plain contains a crossing family of size $\\sqrt{n/12}$. In this paper we present a generalization of the concept and give several results regarding this generalization."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.09888","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":"1805.09888","created_at":"2026-05-17T23:49:22.462204+00:00"},{"alias_kind":"arxiv_version","alias_value":"1805.09888v2","created_at":"2026-05-17T23:49:22.462204+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.09888","created_at":"2026-05-17T23:49:22.462204+00:00"},{"alias_kind":"pith_short_12","alias_value":"7GA7VYM6K2AD","created_at":"2026-05-18T12:32:11.075285+00:00"},{"alias_kind":"pith_short_16","alias_value":"7GA7VYM6K2AD6N6R","created_at":"2026-05-18T12:32:11.075285+00:00"},{"alias_kind":"pith_short_8","alias_value":"7GA7VYM6","created_at":"2026-05-18T12:32:11.075285+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/7GA7VYM6K2AD6N6RIOVMB4ATM5","json":"https://pith.science/pith/7GA7VYM6K2AD6N6RIOVMB4ATM5.json","graph_json":"https://pith.science/api/pith-number/7GA7VYM6K2AD6N6RIOVMB4ATM5/graph.json","events_json":"https://pith.science/api/pith-number/7GA7VYM6K2AD6N6RIOVMB4ATM5/events.json","paper":"https://pith.science/paper/7GA7VYM6"},"agent_actions":{"view_html":"https://pith.science/pith/7GA7VYM6K2AD6N6RIOVMB4ATM5","download_json":"https://pith.science/pith/7GA7VYM6K2AD6N6RIOVMB4ATM5.json","view_paper":"https://pith.science/paper/7GA7VYM6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1805.09888&json=true","fetch_graph":"https://pith.science/api/pith-number/7GA7VYM6K2AD6N6RIOVMB4ATM5/graph.json","fetch_events":"https://pith.science/api/pith-number/7GA7VYM6K2AD6N6RIOVMB4ATM5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7GA7VYM6K2AD6N6RIOVMB4ATM5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7GA7VYM6K2AD6N6RIOVMB4ATM5/action/storage_attestation","attest_author":"https://pith.science/pith/7GA7VYM6K2AD6N6RIOVMB4ATM5/action/author_attestation","sign_citation":"https://pith.science/pith/7GA7VYM6K2AD6N6RIOVMB4ATM5/action/citation_signature","submit_replication":"https://pith.science/pith/7GA7VYM6K2AD6N6RIOVMB4ATM5/action/replication_record"}},"created_at":"2026-05-17T23:49:22.462204+00:00","updated_at":"2026-05-17T23:49:22.462204+00:00"}