{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:CBFI35L2CC42SP5HWXXAPWER54","short_pith_number":"pith:CBFI35L2","schema_version":"1.0","canonical_sha256":"104a8df57a10b9a93fa7b5ee07d891ef1327b6660d1b83aa77b150423c567df6","source":{"kind":"arxiv","id":"2507.01928","version":2},"attestation_state":"computed","paper":{"title":"The independence and clique cover numbers of the squarefree graph","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["math.NT"],"primary_cat":"math.CO","authors_text":"Boris Alexeev, Dustin G. Mixon, Will Sawin","submitted_at":"2025-07-02T17:39:17Z","abstract_excerpt":"We determine the largest subset $A\\subseteq \\{1,\\dotsc,n\\}$ such that for all $a,b\\in A$, the product $ab$ is not squarefree. Specifically, the maximum size is achieved by the complement of the odd squarefree numbers.\n  This resolves a problem of Paul Erd\\H{o}s and Andr\\'as S\\'ark\\\"ozy from 1992."},"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":"2507.01928","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2025-07-02T17:39:17Z","cross_cats_sorted":["math.NT"],"title_canon_sha256":"ac830f21ebaf42f08b63f5dfc98e08bece33a87bf819d46692c81c0a0249259a","abstract_canon_sha256":"2ae826a1d7f0afde4446126e78a09bbbf054061334cc19eb6abaa073f1cc10c2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:31:29.473225Z","signature_b64":"PWiOfABbLemtwNvk2VIhZsMEvTvP+HQyvE/cMroul6LQ+eTAheSXr/5COV06Ql7KOO5RhCtau9c2KejtA9RwAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"104a8df57a10b9a93fa7b5ee07d891ef1327b6660d1b83aa77b150423c567df6","last_reissued_at":"2026-07-05T11:31:29.472762Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:31:29.472762Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The independence and clique cover numbers of the squarefree graph","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["math.NT"],"primary_cat":"math.CO","authors_text":"Boris Alexeev, Dustin G. Mixon, Will Sawin","submitted_at":"2025-07-02T17:39:17Z","abstract_excerpt":"We determine the largest subset $A\\subseteq \\{1,\\dotsc,n\\}$ such that for all $a,b\\in A$, the product $ab$ is not squarefree. Specifically, the maximum size is achieved by the complement of the odd squarefree numbers.\n  This resolves a problem of Paul Erd\\H{o}s and Andr\\'as S\\'ark\\\"ozy from 1992."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2507.01928","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2507.01928/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":"2507.01928","created_at":"2026-07-05T11:31:29.472819+00:00"},{"alias_kind":"arxiv_version","alias_value":"2507.01928v2","created_at":"2026-07-05T11:31:29.472819+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2507.01928","created_at":"2026-07-05T11:31:29.472819+00:00"},{"alias_kind":"pith_short_12","alias_value":"CBFI35L2CC42","created_at":"2026-07-05T11:31:29.472819+00:00"},{"alias_kind":"pith_short_16","alias_value":"CBFI35L2CC42SP5H","created_at":"2026-07-05T11:31:29.472819+00:00"},{"alias_kind":"pith_short_8","alias_value":"CBFI35L2","created_at":"2026-07-05T11:31:29.472819+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/CBFI35L2CC42SP5HWXXAPWER54","json":"https://pith.science/pith/CBFI35L2CC42SP5HWXXAPWER54.json","graph_json":"https://pith.science/api/pith-number/CBFI35L2CC42SP5HWXXAPWER54/graph.json","events_json":"https://pith.science/api/pith-number/CBFI35L2CC42SP5HWXXAPWER54/events.json","paper":"https://pith.science/paper/CBFI35L2"},"agent_actions":{"view_html":"https://pith.science/pith/CBFI35L2CC42SP5HWXXAPWER54","download_json":"https://pith.science/pith/CBFI35L2CC42SP5HWXXAPWER54.json","view_paper":"https://pith.science/paper/CBFI35L2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2507.01928&json=true","fetch_graph":"https://pith.science/api/pith-number/CBFI35L2CC42SP5HWXXAPWER54/graph.json","fetch_events":"https://pith.science/api/pith-number/CBFI35L2CC42SP5HWXXAPWER54/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CBFI35L2CC42SP5HWXXAPWER54/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CBFI35L2CC42SP5HWXXAPWER54/action/storage_attestation","attest_author":"https://pith.science/pith/CBFI35L2CC42SP5HWXXAPWER54/action/author_attestation","sign_citation":"https://pith.science/pith/CBFI35L2CC42SP5HWXXAPWER54/action/citation_signature","submit_replication":"https://pith.science/pith/CBFI35L2CC42SP5HWXXAPWER54/action/replication_record"}},"created_at":"2026-07-05T11:31:29.472819+00:00","updated_at":"2026-07-05T11:31:29.472819+00:00"}