{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:JBQMC3Z2FS7QBRAIT6L24Z32HV","short_pith_number":"pith:JBQMC3Z2","canonical_record":{"source":{"id":"1908.03523","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-08-09T16:26:23Z","cross_cats_sorted":[],"title_canon_sha256":"3948b0b2e95fd50cff38ebf3728b32ed328e9c7239857d038c9cd456b04b0267","abstract_canon_sha256":"56f4e69e6f39a65be28287995cbb8d4eb4225a38b601823d39fcb6c4bc3bb5ed"},"schema_version":"1.0"},"canonical_sha256":"4860c16f3a2cbf00c4089f97ae677a3d5861efa9f7aab861ca8b1efa6723d978","source":{"kind":"arxiv","id":"1908.03523","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1908.03523","created_at":"2026-07-05T00:58:23Z"},{"alias_kind":"arxiv_version","alias_value":"1908.03523v3","created_at":"2026-07-05T00:58:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.03523","created_at":"2026-07-05T00:58:23Z"},{"alias_kind":"pith_short_12","alias_value":"JBQMC3Z2FS7Q","created_at":"2026-07-05T00:58:23Z"},{"alias_kind":"pith_short_16","alias_value":"JBQMC3Z2FS7QBRAI","created_at":"2026-07-05T00:58:23Z"},{"alias_kind":"pith_short_8","alias_value":"JBQMC3Z2","created_at":"2026-07-05T00:58:23Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:JBQMC3Z2FS7QBRAIT6L24Z32HV","target":"record","payload":{"canonical_record":{"source":{"id":"1908.03523","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-08-09T16:26:23Z","cross_cats_sorted":[],"title_canon_sha256":"3948b0b2e95fd50cff38ebf3728b32ed328e9c7239857d038c9cd456b04b0267","abstract_canon_sha256":"56f4e69e6f39a65be28287995cbb8d4eb4225a38b601823d39fcb6c4bc3bb5ed"},"schema_version":"1.0"},"canonical_sha256":"4860c16f3a2cbf00c4089f97ae677a3d5861efa9f7aab861ca8b1efa6723d978","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:58:23.973265Z","signature_b64":"AJchW9+h1xUDSAT/5Sfv4Ix5y4vCo3eql2J+WsPhTUo0kMVYZ7rMv/Xe/wuALVZrX8IVYjsBYM7xt5LL9agUDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4860c16f3a2cbf00c4089f97ae677a3d5861efa9f7aab861ca8b1efa6723d978","last_reissued_at":"2026-07-05T00:58:23.972916Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:58:23.972916Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1908.03523","source_version":3,"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-05T00:58:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Nq2h/TPOgwD0cdG4d12jvTzaBCG2Goi+C0Rx0itEEUs23QzjiEg/XnwXJZ36fzGdpW/6TlBkhykvvnkl4ecsCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-16T13:33:22.293034Z"},"content_sha256":"c8c5d2635871e27d899b84250063ba0af20492974738d8de01ba0f29d4967515","schema_version":"1.0","event_id":"sha256:c8c5d2635871e27d899b84250063ba0af20492974738d8de01ba0f29d4967515"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:JBQMC3Z2FS7QBRAIT6L24Z32HV","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On $2$-parent-identifying set systems of block size $4$","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Shohei Satake, Yujie Gu","submitted_at":"2019-08-09T16:26:23Z","abstract_excerpt":"Parent-identifying set system is a kind of combinatorial structures with applications to broadcast encryption. In this paper we investigate the maximum number of blocks $I_2(n,4)$ in a $2$-parent-identifying set system with ground set size $n$ and block size $4$. The previous best known lower bound states that $I_2(n,4)=\\Omega(n^{4/3+o(1)})$. We improve this lower bound by showing that $I_2(n,4)= \\Omega(n^{3/2-o(1)})$ using techniques in additive number theory."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1908.03523","kind":"arxiv","version":3},"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/1908.03523/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-05T00:58:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8LssBiy2Naqbcu6jhKYM0EZiEyAG+/WICW+cw9Q32C14+cW/AkVAxIuYfmN7mug5awcKqgbkN4MEAQDNbAUXBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-16T13:33:22.294256Z"},"content_sha256":"ccb9ff218b986104c018bfdf3819bdf8c12fb9744e8fee2cba59fc4f9b53dc8c","schema_version":"1.0","event_id":"sha256:ccb9ff218b986104c018bfdf3819bdf8c12fb9744e8fee2cba59fc4f9b53dc8c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/JBQMC3Z2FS7QBRAIT6L24Z32HV/bundle.json","state_url":"https://pith.science/pith/JBQMC3Z2FS7QBRAIT6L24Z32HV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/JBQMC3Z2FS7QBRAIT6L24Z32HV/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-16T13:33:22Z","links":{"resolver":"https://pith.science/pith/JBQMC3Z2FS7QBRAIT6L24Z32HV","bundle":"https://pith.science/pith/JBQMC3Z2FS7QBRAIT6L24Z32HV/bundle.json","state":"https://pith.science/pith/JBQMC3Z2FS7QBRAIT6L24Z32HV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/JBQMC3Z2FS7QBRAIT6L24Z32HV/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:JBQMC3Z2FS7QBRAIT6L24Z32HV","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":"56f4e69e6f39a65be28287995cbb8d4eb4225a38b601823d39fcb6c4bc3bb5ed","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-08-09T16:26:23Z","title_canon_sha256":"3948b0b2e95fd50cff38ebf3728b32ed328e9c7239857d038c9cd456b04b0267"},"schema_version":"1.0","source":{"id":"1908.03523","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1908.03523","created_at":"2026-07-05T00:58:23Z"},{"alias_kind":"arxiv_version","alias_value":"1908.03523v3","created_at":"2026-07-05T00:58:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.03523","created_at":"2026-07-05T00:58:23Z"},{"alias_kind":"pith_short_12","alias_value":"JBQMC3Z2FS7Q","created_at":"2026-07-05T00:58:23Z"},{"alias_kind":"pith_short_16","alias_value":"JBQMC3Z2FS7QBRAI","created_at":"2026-07-05T00:58:23Z"},{"alias_kind":"pith_short_8","alias_value":"JBQMC3Z2","created_at":"2026-07-05T00:58:23Z"}],"graph_snapshots":[{"event_id":"sha256:ccb9ff218b986104c018bfdf3819bdf8c12fb9744e8fee2cba59fc4f9b53dc8c","target":"graph","created_at":"2026-07-05T00:58:23Z","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/1908.03523/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Parent-identifying set system is a kind of combinatorial structures with applications to broadcast encryption. In this paper we investigate the maximum number of blocks $I_2(n,4)$ in a $2$-parent-identifying set system with ground set size $n$ and block size $4$. The previous best known lower bound states that $I_2(n,4)=\\Omega(n^{4/3+o(1)})$. We improve this lower bound by showing that $I_2(n,4)= \\Omega(n^{3/2-o(1)})$ using techniques in additive number theory.","authors_text":"Shohei Satake, Yujie Gu","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-08-09T16:26:23Z","title":"On $2$-parent-identifying set systems of block size $4$"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1908.03523","kind":"arxiv","version":3},"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:c8c5d2635871e27d899b84250063ba0af20492974738d8de01ba0f29d4967515","target":"record","created_at":"2026-07-05T00:58:23Z","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":"56f4e69e6f39a65be28287995cbb8d4eb4225a38b601823d39fcb6c4bc3bb5ed","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-08-09T16:26:23Z","title_canon_sha256":"3948b0b2e95fd50cff38ebf3728b32ed328e9c7239857d038c9cd456b04b0267"},"schema_version":"1.0","source":{"id":"1908.03523","kind":"arxiv","version":3}},"canonical_sha256":"4860c16f3a2cbf00c4089f97ae677a3d5861efa9f7aab861ca8b1efa6723d978","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4860c16f3a2cbf00c4089f97ae677a3d5861efa9f7aab861ca8b1efa6723d978","first_computed_at":"2026-07-05T00:58:23.972916Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T00:58:23.972916Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"AJchW9+h1xUDSAT/5Sfv4Ix5y4vCo3eql2J+WsPhTUo0kMVYZ7rMv/Xe/wuALVZrX8IVYjsBYM7xt5LL9agUDw==","signature_status":"signed_v1","signed_at":"2026-07-05T00:58:23.973265Z","signed_message":"canonical_sha256_bytes"},"source_id":"1908.03523","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c8c5d2635871e27d899b84250063ba0af20492974738d8de01ba0f29d4967515","sha256:ccb9ff218b986104c018bfdf3819bdf8c12fb9744e8fee2cba59fc4f9b53dc8c"],"state_sha256":"481f4d220ed6d3fad7858be0617fa79e6f59f9bd7f90171636982267c100ddd8"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EpsbdkAhoxJ7glqJ1xRXnz+RTZZ+utDfF39IRC5FoDP0GJHg3Ou4uEOW6vrJBRD68OMiezGSoxI8QDqh6YqJAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-16T13:33:22.310906Z","bundle_sha256":"4171cc9613527defc0b661f65f69f81d8c1e90d6de8dc1cac890e22616c9ca25"}}