{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:VAICBANIPCO5K657WXATF22NJ2","short_pith_number":"pith:VAICBANI","schema_version":"1.0","canonical_sha256":"a8102081a8789dd57bbfb5c132eb4d4ea20df1a764302cf10fce16d83d4093c7","source":{"kind":"arxiv","id":"2508.21819","version":1},"attestation_state":"computed","paper":{"title":"The sandglass conjecture beyond cancellative pairs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Adva Mond, Leo Versteegen, Victor Souza","submitted_at":"2025-08-29T17:54:05Z","abstract_excerpt":"The sandglass conjecture, posed by Simonyi, states that if a pair $(A, B)$ of families of subsets of $[n]$ is recovering then $|A| |B| \\leq 2^n$. We improve the best known upper bound to $|A| |B| \\leq 2.2543^n$. To do this we overcome a significant barrier by exponentially separating the upper bounds on recovering pairs from cancellative pairs, a related notion."},"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":"2508.21819","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2025-08-29T17:54:05Z","cross_cats_sorted":[],"title_canon_sha256":"39e04c7875df923b380b4d0a2dd4b4860df84cefd95b3b8c69ca0469914679c2","abstract_canon_sha256":"a529a56fde78881045bf58254102756fc91596304936374999d93955c17ec255"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T12:01:50.599038Z","signature_b64":"/bS5LUdZxklXEEEAIX5QlE3sYTjeZETIi6wfkbRj69S2sMR4MdIYqXtYeVfLtS9iJ7yqbi/XJURM6PXQyPNJCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a8102081a8789dd57bbfb5c132eb4d4ea20df1a764302cf10fce16d83d4093c7","last_reissued_at":"2026-07-05T12:01:50.598327Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T12:01:50.598327Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The sandglass conjecture beyond cancellative pairs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Adva Mond, Leo Versteegen, Victor Souza","submitted_at":"2025-08-29T17:54:05Z","abstract_excerpt":"The sandglass conjecture, posed by Simonyi, states that if a pair $(A, B)$ of families of subsets of $[n]$ is recovering then $|A| |B| \\leq 2^n$. We improve the best known upper bound to $|A| |B| \\leq 2.2543^n$. To do this we overcome a significant barrier by exponentially separating the upper bounds on recovering pairs from cancellative pairs, a related notion."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2508.21819","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2508.21819/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":"2508.21819","created_at":"2026-07-05T12:01:50.598424+00:00"},{"alias_kind":"arxiv_version","alias_value":"2508.21819v1","created_at":"2026-07-05T12:01:50.598424+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2508.21819","created_at":"2026-07-05T12:01:50.598424+00:00"},{"alias_kind":"pith_short_12","alias_value":"VAICBANIPCO5","created_at":"2026-07-05T12:01:50.598424+00:00"},{"alias_kind":"pith_short_16","alias_value":"VAICBANIPCO5K657","created_at":"2026-07-05T12:01:50.598424+00:00"},{"alias_kind":"pith_short_8","alias_value":"VAICBANI","created_at":"2026-07-05T12:01:50.598424+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/VAICBANIPCO5K657WXATF22NJ2","json":"https://pith.science/pith/VAICBANIPCO5K657WXATF22NJ2.json","graph_json":"https://pith.science/api/pith-number/VAICBANIPCO5K657WXATF22NJ2/graph.json","events_json":"https://pith.science/api/pith-number/VAICBANIPCO5K657WXATF22NJ2/events.json","paper":"https://pith.science/paper/VAICBANI"},"agent_actions":{"view_html":"https://pith.science/pith/VAICBANIPCO5K657WXATF22NJ2","download_json":"https://pith.science/pith/VAICBANIPCO5K657WXATF22NJ2.json","view_paper":"https://pith.science/paper/VAICBANI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2508.21819&json=true","fetch_graph":"https://pith.science/api/pith-number/VAICBANIPCO5K657WXATF22NJ2/graph.json","fetch_events":"https://pith.science/api/pith-number/VAICBANIPCO5K657WXATF22NJ2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VAICBANIPCO5K657WXATF22NJ2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VAICBANIPCO5K657WXATF22NJ2/action/storage_attestation","attest_author":"https://pith.science/pith/VAICBANIPCO5K657WXATF22NJ2/action/author_attestation","sign_citation":"https://pith.science/pith/VAICBANIPCO5K657WXATF22NJ2/action/citation_signature","submit_replication":"https://pith.science/pith/VAICBANIPCO5K657WXATF22NJ2/action/replication_record"}},"created_at":"2026-07-05T12:01:50.598424+00:00","updated_at":"2026-07-05T12:01:50.598424+00:00"}