{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:GGQPKITEFHNNYZOYUDHMIY6POA","short_pith_number":"pith:GGQPKITE","canonical_record":{"source":{"id":"1209.3598","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-09-17T09:13:10Z","cross_cats_sorted":[],"title_canon_sha256":"a9fba7e3e2372111d308360c76411dd2ecf5b7f4fa2c2483c4cc864377268ed4","abstract_canon_sha256":"5fbf17a70f8451c5076ee73428913c01af8fdbeae7e7ea99dbeb771866479416"},"schema_version":"1.0"},"canonical_sha256":"31a0f5226429dadc65d8a0cec463cf703237ab1adc1de316409852884cc7cb6f","source":{"kind":"arxiv","id":"1209.3598","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1209.3598","created_at":"2026-05-18T03:01:36Z"},{"alias_kind":"arxiv_version","alias_value":"1209.3598v2","created_at":"2026-05-18T03:01:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1209.3598","created_at":"2026-05-18T03:01:36Z"},{"alias_kind":"pith_short_12","alias_value":"GGQPKITEFHNN","created_at":"2026-05-18T12:27:06Z"},{"alias_kind":"pith_short_16","alias_value":"GGQPKITEFHNNYZOY","created_at":"2026-05-18T12:27:06Z"},{"alias_kind":"pith_short_8","alias_value":"GGQPKITE","created_at":"2026-05-18T12:27:06Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:GGQPKITEFHNNYZOYUDHMIY6POA","target":"record","payload":{"canonical_record":{"source":{"id":"1209.3598","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-09-17T09:13:10Z","cross_cats_sorted":[],"title_canon_sha256":"a9fba7e3e2372111d308360c76411dd2ecf5b7f4fa2c2483c4cc864377268ed4","abstract_canon_sha256":"5fbf17a70f8451c5076ee73428913c01af8fdbeae7e7ea99dbeb771866479416"},"schema_version":"1.0"},"canonical_sha256":"31a0f5226429dadc65d8a0cec463cf703237ab1adc1de316409852884cc7cb6f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:01:36.005876Z","signature_b64":"syn8L2yQyM2hyKkVbSIlypLoJCZhOkDU7NAhY+KRkUT5xKMDjOIgKjKFe/vMGzTIUXL4Dkn9xqzqoAJxrAsEDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"31a0f5226429dadc65d8a0cec463cf703237ab1adc1de316409852884cc7cb6f","last_reissued_at":"2026-05-18T03:01:36.005219Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:01:36.005219Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1209.3598","source_version":2,"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-05-18T03:01:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7JpR333jyKlB3/spOdvtAjfF5lxjDJpAki1cjOQUnRinytB8GgCfeIZsvvRT5X2gyugryegzGzt7POn9aQHXCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T03:11:36.418714Z"},"content_sha256":"d4ae1e7a4d1ebe9c4c9eccb2f63ae8c6a8d38202619b24e7ca997db915f90363","schema_version":"1.0","event_id":"sha256:d4ae1e7a4d1ebe9c4c9eccb2f63ae8c6a8d38202619b24e7ca997db915f90363"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:GGQPKITEFHNNYZOYUDHMIY6POA","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Exact Bounds for Some Hypergraph Saturation Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Asaf Shapira, Guy Moshkovitz","submitted_at":"2012-09-17T09:13:10Z","abstract_excerpt":"Let W_n(p,q) denote the minimum number of edges in an n x n bipartite graph G on vertex sets X,Y that satisfies the following condition; one can add the edges between X and Y that do not belong to G one after the other so that whenever a new edge is added, a new copy of K_{p,q} is created. The problem of bounding W_n(p,q), and its natural hypergraph generalization, was introduced by Balogh, Bollob\\'as, Morris and Riordan. Their main result, specialized to graphs, used algebraic methods to determine W_n(1,q).\n  Our main results in this paper give exact bounds for W_n(p,q), its hypergraph analog"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1209.3598","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"},"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-05-18T03:01:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vh5X6zzM9P4SpsjLzhTOvGBQILgYEsw4u3tNC9uO3TAqBoSFtUeNWqsVrFpYRumFFRqxEqJ6x9eoCmwvvMrFDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T03:11:36.419074Z"},"content_sha256":"0b651dd94b52e813557bdce92c73f2017221e2c2fe375fd573f6252dd6f2e47f","schema_version":"1.0","event_id":"sha256:0b651dd94b52e813557bdce92c73f2017221e2c2fe375fd573f6252dd6f2e47f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GGQPKITEFHNNYZOYUDHMIY6POA/bundle.json","state_url":"https://pith.science/pith/GGQPKITEFHNNYZOYUDHMIY6POA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GGQPKITEFHNNYZOYUDHMIY6POA/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-06-01T03:11:36Z","links":{"resolver":"https://pith.science/pith/GGQPKITEFHNNYZOYUDHMIY6POA","bundle":"https://pith.science/pith/GGQPKITEFHNNYZOYUDHMIY6POA/bundle.json","state":"https://pith.science/pith/GGQPKITEFHNNYZOYUDHMIY6POA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GGQPKITEFHNNYZOYUDHMIY6POA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:GGQPKITEFHNNYZOYUDHMIY6POA","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":"5fbf17a70f8451c5076ee73428913c01af8fdbeae7e7ea99dbeb771866479416","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-09-17T09:13:10Z","title_canon_sha256":"a9fba7e3e2372111d308360c76411dd2ecf5b7f4fa2c2483c4cc864377268ed4"},"schema_version":"1.0","source":{"id":"1209.3598","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1209.3598","created_at":"2026-05-18T03:01:36Z"},{"alias_kind":"arxiv_version","alias_value":"1209.3598v2","created_at":"2026-05-18T03:01:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1209.3598","created_at":"2026-05-18T03:01:36Z"},{"alias_kind":"pith_short_12","alias_value":"GGQPKITEFHNN","created_at":"2026-05-18T12:27:06Z"},{"alias_kind":"pith_short_16","alias_value":"GGQPKITEFHNNYZOY","created_at":"2026-05-18T12:27:06Z"},{"alias_kind":"pith_short_8","alias_value":"GGQPKITE","created_at":"2026-05-18T12:27:06Z"}],"graph_snapshots":[{"event_id":"sha256:0b651dd94b52e813557bdce92c73f2017221e2c2fe375fd573f6252dd6f2e47f","target":"graph","created_at":"2026-05-18T03:01:36Z","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"},"paper":{"abstract_excerpt":"Let W_n(p,q) denote the minimum number of edges in an n x n bipartite graph G on vertex sets X,Y that satisfies the following condition; one can add the edges between X and Y that do not belong to G one after the other so that whenever a new edge is added, a new copy of K_{p,q} is created. The problem of bounding W_n(p,q), and its natural hypergraph generalization, was introduced by Balogh, Bollob\\'as, Morris and Riordan. Their main result, specialized to graphs, used algebraic methods to determine W_n(1,q).\n  Our main results in this paper give exact bounds for W_n(p,q), its hypergraph analog","authors_text":"Asaf Shapira, Guy Moshkovitz","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-09-17T09:13:10Z","title":"Exact Bounds for Some Hypergraph Saturation Problems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1209.3598","kind":"arxiv","version":2},"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:d4ae1e7a4d1ebe9c4c9eccb2f63ae8c6a8d38202619b24e7ca997db915f90363","target":"record","created_at":"2026-05-18T03:01:36Z","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":"5fbf17a70f8451c5076ee73428913c01af8fdbeae7e7ea99dbeb771866479416","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-09-17T09:13:10Z","title_canon_sha256":"a9fba7e3e2372111d308360c76411dd2ecf5b7f4fa2c2483c4cc864377268ed4"},"schema_version":"1.0","source":{"id":"1209.3598","kind":"arxiv","version":2}},"canonical_sha256":"31a0f5226429dadc65d8a0cec463cf703237ab1adc1de316409852884cc7cb6f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"31a0f5226429dadc65d8a0cec463cf703237ab1adc1de316409852884cc7cb6f","first_computed_at":"2026-05-18T03:01:36.005219Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:01:36.005219Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"syn8L2yQyM2hyKkVbSIlypLoJCZhOkDU7NAhY+KRkUT5xKMDjOIgKjKFe/vMGzTIUXL4Dkn9xqzqoAJxrAsEDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:01:36.005876Z","signed_message":"canonical_sha256_bytes"},"source_id":"1209.3598","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d4ae1e7a4d1ebe9c4c9eccb2f63ae8c6a8d38202619b24e7ca997db915f90363","sha256:0b651dd94b52e813557bdce92c73f2017221e2c2fe375fd573f6252dd6f2e47f"],"state_sha256":"3a22be2d55acd9565621a8dc8e843cd49b2272edd0aa71f0a2621adacaadae81"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Kebp9UkdhlcLyWAbIOk4vlfbDgJuq4ER/notcqNeMgUNSxMZ2QJPieyqRJQ7mc9czV6cz9783B2NHajHgMsYDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T03:11:36.421183Z","bundle_sha256":"02959f2f284aaeccd12df04e45e47e3d27e54d6fe6361dadba73ab9a98ab637e"}}