{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:VAICBANIPCO5K657WXATF22NJ2","short_pith_number":"pith:VAICBANI","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"},"canonical_sha256":"a8102081a8789dd57bbfb5c132eb4d4ea20df1a764302cf10fce16d83d4093c7","source":{"kind":"arxiv","id":"2508.21819","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2508.21819","created_at":"2026-07-05T12:01:50Z"},{"alias_kind":"arxiv_version","alias_value":"2508.21819v1","created_at":"2026-07-05T12:01:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2508.21819","created_at":"2026-07-05T12:01:50Z"},{"alias_kind":"pith_short_12","alias_value":"VAICBANIPCO5","created_at":"2026-07-05T12:01:50Z"},{"alias_kind":"pith_short_16","alias_value":"VAICBANIPCO5K657","created_at":"2026-07-05T12:01:50Z"},{"alias_kind":"pith_short_8","alias_value":"VAICBANI","created_at":"2026-07-05T12:01:50Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:VAICBANIPCO5K657WXATF22NJ2","target":"record","payload":{"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"},"canonical_sha256":"a8102081a8789dd57bbfb5c132eb4d4ea20df1a764302cf10fce16d83d4093c7","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"},"source_kind":"arxiv","source_id":"2508.21819","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T12:01:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zgD6LtfdLctVhorergIq8Hk+ugZ/99CRbv8dlg2ubTZg+w7MAYWLEq3f3afZ0JoNNvCloc9ZBxBythZ7R4tOAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-19T07:12:14.604451Z"},"content_sha256":"a1f1a846632bd4694082af6c0f0eea48a7cde718b15f43fb80634b425be5ceed","schema_version":"1.0","event_id":"sha256:a1f1a846632bd4694082af6c0f0eea48a7cde718b15f43fb80634b425be5ceed"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:VAICBANIPCO5K657WXATF22NJ2","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T12:01:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7zvgIW+1/PlYbhlwDADhVWTdZw6857imJpCE3AVhXGnKbgP9LjxJNdMmRKRd2KHaxJ8pHcS93ip+LB88OUZ6AA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-19T07:12:14.604823Z"},"content_sha256":"4ab71253e4cb900bc3868307f952524d94b5abd15d0ab2e66a31a3b48fe7c868","schema_version":"1.0","event_id":"sha256:4ab71253e4cb900bc3868307f952524d94b5abd15d0ab2e66a31a3b48fe7c868"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VAICBANIPCO5K657WXATF22NJ2/bundle.json","state_url":"https://pith.science/pith/VAICBANIPCO5K657WXATF22NJ2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VAICBANIPCO5K657WXATF22NJ2/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-07-19T07:12:14Z","links":{"resolver":"https://pith.science/pith/VAICBANIPCO5K657WXATF22NJ2","bundle":"https://pith.science/pith/VAICBANIPCO5K657WXATF22NJ2/bundle.json","state":"https://pith.science/pith/VAICBANIPCO5K657WXATF22NJ2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VAICBANIPCO5K657WXATF22NJ2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:VAICBANIPCO5K657WXATF22NJ2","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"a529a56fde78881045bf58254102756fc91596304936374999d93955c17ec255","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2025-08-29T17:54:05Z","title_canon_sha256":"39e04c7875df923b380b4d0a2dd4b4860df84cefd95b3b8c69ca0469914679c2"},"schema_version":"1.0","source":{"id":"2508.21819","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2508.21819","created_at":"2026-07-05T12:01:50Z"},{"alias_kind":"arxiv_version","alias_value":"2508.21819v1","created_at":"2026-07-05T12:01:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2508.21819","created_at":"2026-07-05T12:01:50Z"},{"alias_kind":"pith_short_12","alias_value":"VAICBANIPCO5","created_at":"2026-07-05T12:01:50Z"},{"alias_kind":"pith_short_16","alias_value":"VAICBANIPCO5K657","created_at":"2026-07-05T12:01:50Z"},{"alias_kind":"pith_short_8","alias_value":"VAICBANI","created_at":"2026-07-05T12:01:50Z"}],"graph_snapshots":[{"event_id":"sha256:4ab71253e4cb900bc3868307f952524d94b5abd15d0ab2e66a31a3b48fe7c868","target":"graph","created_at":"2026-07-05T12:01:50Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2508.21819/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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.","authors_text":"Adva Mond, Leo Versteegen, Victor Souza","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2025-08-29T17:54:05Z","title":"The sandglass conjecture beyond cancellative pairs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2508.21819","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:a1f1a846632bd4694082af6c0f0eea48a7cde718b15f43fb80634b425be5ceed","target":"record","created_at":"2026-07-05T12:01:50Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"a529a56fde78881045bf58254102756fc91596304936374999d93955c17ec255","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2025-08-29T17:54:05Z","title_canon_sha256":"39e04c7875df923b380b4d0a2dd4b4860df84cefd95b3b8c69ca0469914679c2"},"schema_version":"1.0","source":{"id":"2508.21819","kind":"arxiv","version":1}},"canonical_sha256":"a8102081a8789dd57bbfb5c132eb4d4ea20df1a764302cf10fce16d83d4093c7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a8102081a8789dd57bbfb5c132eb4d4ea20df1a764302cf10fce16d83d4093c7","first_computed_at":"2026-07-05T12:01:50.598327Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T12:01:50.598327Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"/bS5LUdZxklXEEEAIX5QlE3sYTjeZETIi6wfkbRj69S2sMR4MdIYqXtYeVfLtS9iJ7yqbi/XJURM6PXQyPNJCA==","signature_status":"signed_v1","signed_at":"2026-07-05T12:01:50.599038Z","signed_message":"canonical_sha256_bytes"},"source_id":"2508.21819","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a1f1a846632bd4694082af6c0f0eea48a7cde718b15f43fb80634b425be5ceed","sha256:4ab71253e4cb900bc3868307f952524d94b5abd15d0ab2e66a31a3b48fe7c868"],"state_sha256":"de3a05406d08763ced4f493160f88190827bf98154af848370bf2580f71be8dc"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JOJuW21ol3x8SkYAKTFcgHB/kpRZ76UvqEv4kEgem62EiCM2nk9OwZuLDqBWyj7E9sqQa5BNQcAT64pEC9c0Dw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-19T07:12:14.606989Z","bundle_sha256":"01d4554e46becd0d537d2934f14baf76fab765645c0a115b7e910b5dd3d67ed9"}}