{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:B23FM57L45TAGNOIPSY3NCYQKL","short_pith_number":"pith:B23FM57L","canonical_record":{"source":{"id":"2606.25055","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2026-06-23T18:11:17Z","cross_cats_sorted":[],"title_canon_sha256":"af583d009cffd5a0b1351c1091f669cb9c77b099789506d75fd2d1fea5846add","abstract_canon_sha256":"b714e1c217ba6e8c2bd331333be5904a4ca3fe32042c1b3002fb6e209ece7778"},"schema_version":"1.0"},"canonical_sha256":"0eb65677ebe7660335c87cb1b68b1052eb89d160a291b097fe336d8333fb1b39","source":{"kind":"arxiv","id":"2606.25055","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2606.25055","created_at":"2026-06-25T00:18:16Z"},{"alias_kind":"arxiv_version","alias_value":"2606.25055v1","created_at":"2026-06-25T00:18:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.25055","created_at":"2026-06-25T00:18:16Z"},{"alias_kind":"pith_short_12","alias_value":"B23FM57L45TA","created_at":"2026-06-25T00:18:16Z"},{"alias_kind":"pith_short_16","alias_value":"B23FM57L45TAGNOI","created_at":"2026-06-25T00:18:16Z"},{"alias_kind":"pith_short_8","alias_value":"B23FM57L","created_at":"2026-06-25T00:18:16Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:B23FM57L45TAGNOIPSY3NCYQKL","target":"record","payload":{"canonical_record":{"source":{"id":"2606.25055","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2026-06-23T18:11:17Z","cross_cats_sorted":[],"title_canon_sha256":"af583d009cffd5a0b1351c1091f669cb9c77b099789506d75fd2d1fea5846add","abstract_canon_sha256":"b714e1c217ba6e8c2bd331333be5904a4ca3fe32042c1b3002fb6e209ece7778"},"schema_version":"1.0"},"canonical_sha256":"0eb65677ebe7660335c87cb1b68b1052eb89d160a291b097fe336d8333fb1b39","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-25T00:18:16.412855Z","signature_b64":"XpSPFY9n3901UJjpFUcfrMUykArvBq3w5RejfWOtFUa6Xx6GENXvmO26/eyi/zm4X0ScssSdjv9dZoSIqhauBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0eb65677ebe7660335c87cb1b68b1052eb89d160a291b097fe336d8333fb1b39","last_reissued_at":"2026-06-25T00:18:16.412487Z","signature_status":"signed_v1","first_computed_at":"2026-06-25T00:18:16.412487Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2606.25055","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-06-25T00:18:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YeMB1oiDdVZtlw3JUNq7xrJ2KwDNsDaNKHuDW/iyKAHIVW3oBhamn6k2ElTQp59WkcM3VtQu6EbazSZhtNqKCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-03T20:28:44.659753Z"},"content_sha256":"89f7918e40c63744a0a8836cc06ba8c71ec83d25d62fc8ea950518d9da8b8e4a","schema_version":"1.0","event_id":"sha256:89f7918e40c63744a0a8836cc06ba8c71ec83d25d62fc8ea950518d9da8b8e4a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:B23FM57L45TAGNOIPSY3NCYQKL","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Pseudoshattering Pairs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Noga Alon, Varun Sivashankar","submitted_at":"2026-06-23T18:11:17Z","abstract_excerpt":"For two vectors $x,y\\in [b]^k$, consider the bipartite graph with two copies of $[b]$ in which $i$ on the left is joined to $j$ on the right if $(x_t,y_t)=(i,j)$ for some coordinate $t$. We study the largest size of a family $C\\subseteq [b]^k$ such that, for every two distinct $x,y\\in C$, this bipartite graph contains a cycle.\n  We give a natural construction for such families and conjecture that it is optimal whenever $k$ is large relative to $b$. We prove an LYM-type upper bound that is asymptotically tight with respect to this construction, and is exact when $k$ is large and divisible by $b"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.25055","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/2606.25055/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-06-25T00:18:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"C2cwVPMuCcspkxyZnKCxa33cxZ/5c55bsRbCxY9FsUUPvhee5iWX/fJsa2aN6HWrr3STdPLag4wFlBrQSwrnAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-03T20:28:44.660283Z"},"content_sha256":"70aa5fab0528a6bc831da2ad02f69a719c41fbc94669fa53bc8fb8c012c18ada","schema_version":"1.0","event_id":"sha256:70aa5fab0528a6bc831da2ad02f69a719c41fbc94669fa53bc8fb8c012c18ada"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/B23FM57L45TAGNOIPSY3NCYQKL/bundle.json","state_url":"https://pith.science/pith/B23FM57L45TAGNOIPSY3NCYQKL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/B23FM57L45TAGNOIPSY3NCYQKL/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-08-03T20:28:44Z","links":{"resolver":"https://pith.science/pith/B23FM57L45TAGNOIPSY3NCYQKL","bundle":"https://pith.science/pith/B23FM57L45TAGNOIPSY3NCYQKL/bundle.json","state":"https://pith.science/pith/B23FM57L45TAGNOIPSY3NCYQKL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/B23FM57L45TAGNOIPSY3NCYQKL/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:B23FM57L45TAGNOIPSY3NCYQKL","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":"b714e1c217ba6e8c2bd331333be5904a4ca3fe32042c1b3002fb6e209ece7778","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2026-06-23T18:11:17Z","title_canon_sha256":"af583d009cffd5a0b1351c1091f669cb9c77b099789506d75fd2d1fea5846add"},"schema_version":"1.0","source":{"id":"2606.25055","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2606.25055","created_at":"2026-06-25T00:18:16Z"},{"alias_kind":"arxiv_version","alias_value":"2606.25055v1","created_at":"2026-06-25T00:18:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.25055","created_at":"2026-06-25T00:18:16Z"},{"alias_kind":"pith_short_12","alias_value":"B23FM57L45TA","created_at":"2026-06-25T00:18:16Z"},{"alias_kind":"pith_short_16","alias_value":"B23FM57L45TAGNOI","created_at":"2026-06-25T00:18:16Z"},{"alias_kind":"pith_short_8","alias_value":"B23FM57L","created_at":"2026-06-25T00:18:16Z"}],"graph_snapshots":[{"event_id":"sha256:70aa5fab0528a6bc831da2ad02f69a719c41fbc94669fa53bc8fb8c012c18ada","target":"graph","created_at":"2026-06-25T00:18:16Z","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/2606.25055/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"For two vectors $x,y\\in [b]^k$, consider the bipartite graph with two copies of $[b]$ in which $i$ on the left is joined to $j$ on the right if $(x_t,y_t)=(i,j)$ for some coordinate $t$. We study the largest size of a family $C\\subseteq [b]^k$ such that, for every two distinct $x,y\\in C$, this bipartite graph contains a cycle.\n  We give a natural construction for such families and conjecture that it is optimal whenever $k$ is large relative to $b$. We prove an LYM-type upper bound that is asymptotically tight with respect to this construction, and is exact when $k$ is large and divisible by $b","authors_text":"Noga Alon, Varun Sivashankar","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2026-06-23T18:11:17Z","title":"Pseudoshattering Pairs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.25055","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:89f7918e40c63744a0a8836cc06ba8c71ec83d25d62fc8ea950518d9da8b8e4a","target":"record","created_at":"2026-06-25T00:18:16Z","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":"b714e1c217ba6e8c2bd331333be5904a4ca3fe32042c1b3002fb6e209ece7778","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2026-06-23T18:11:17Z","title_canon_sha256":"af583d009cffd5a0b1351c1091f669cb9c77b099789506d75fd2d1fea5846add"},"schema_version":"1.0","source":{"id":"2606.25055","kind":"arxiv","version":1}},"canonical_sha256":"0eb65677ebe7660335c87cb1b68b1052eb89d160a291b097fe336d8333fb1b39","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0eb65677ebe7660335c87cb1b68b1052eb89d160a291b097fe336d8333fb1b39","first_computed_at":"2026-06-25T00:18:16.412487Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-25T00:18:16.412487Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"XpSPFY9n3901UJjpFUcfrMUykArvBq3w5RejfWOtFUa6Xx6GENXvmO26/eyi/zm4X0ScssSdjv9dZoSIqhauBA==","signature_status":"signed_v1","signed_at":"2026-06-25T00:18:16.412855Z","signed_message":"canonical_sha256_bytes"},"source_id":"2606.25055","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:89f7918e40c63744a0a8836cc06ba8c71ec83d25d62fc8ea950518d9da8b8e4a","sha256:70aa5fab0528a6bc831da2ad02f69a719c41fbc94669fa53bc8fb8c012c18ada"],"state_sha256":"c2f4a24e911e3332087872a0c6a837140c76d2f18c4de2dfdb5bf60e879b2c94"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yLOzb++4rAQwW5l1aYawxA/f30ViF46y5Nzowl4QmLkD9osq2eiZ6UHteBXd/L9cAjUPN3ZJZVPkMaU1/R4vBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-03T20:28:44.664001Z","bundle_sha256":"e60007ea2d93896624d2f2c886013cde6f6439fc9f19630926af391117c96b7e"}}