{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:NJXEQBBII4KZQMERPYBB72VOUS","short_pith_number":"pith:NJXEQBBI","canonical_record":{"source":{"id":"1905.10807","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-05-26T14:02:30Z","cross_cats_sorted":[],"title_canon_sha256":"52d3dc128b7860fe452308ab8f9f83670a2d4cdc9fa951ee4ae8e343a690c986","abstract_canon_sha256":"eef92bee33d6ffd67977dc5367014cf261b27b28d1a1ab2566a5f7ddf402375c"},"schema_version":"1.0"},"canonical_sha256":"6a6e48042847159830917e021feaaea485f2c3188edfeb12513e912a558c3127","source":{"kind":"arxiv","id":"1905.10807","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1905.10807","created_at":"2026-05-17T23:45:05Z"},{"alias_kind":"arxiv_version","alias_value":"1905.10807v1","created_at":"2026-05-17T23:45:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.10807","created_at":"2026-05-17T23:45:05Z"},{"alias_kind":"pith_short_12","alias_value":"NJXEQBBII4KZ","created_at":"2026-05-18T12:33:24Z"},{"alias_kind":"pith_short_16","alias_value":"NJXEQBBII4KZQMER","created_at":"2026-05-18T12:33:24Z"},{"alias_kind":"pith_short_8","alias_value":"NJXEQBBI","created_at":"2026-05-18T12:33:24Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:NJXEQBBII4KZQMERPYBB72VOUS","target":"record","payload":{"canonical_record":{"source":{"id":"1905.10807","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-05-26T14:02:30Z","cross_cats_sorted":[],"title_canon_sha256":"52d3dc128b7860fe452308ab8f9f83670a2d4cdc9fa951ee4ae8e343a690c986","abstract_canon_sha256":"eef92bee33d6ffd67977dc5367014cf261b27b28d1a1ab2566a5f7ddf402375c"},"schema_version":"1.0"},"canonical_sha256":"6a6e48042847159830917e021feaaea485f2c3188edfeb12513e912a558c3127","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:45:05.218011Z","signature_b64":"ZE6n85Rf4wBsyyHBc4riYe2+369s26xaiBG+EWpSunTxqCevffu9EWs3pWaBXY5OFSYk2hicGa6++PtSU1nQBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6a6e48042847159830917e021feaaea485f2c3188edfeb12513e912a558c3127","last_reissued_at":"2026-05-17T23:45:05.217372Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:45:05.217372Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1905.10807","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-05-17T23:45:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Wzc6GRP4RAnaYGuLK4/2bkJEO8ImIEnG3uCVImwYs4B5+m8+iRFg9A9P8+jNq5FP0pRNCco+1zT9ad26cP6vAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T06:34:44.602899Z"},"content_sha256":"6e684b93b96cad87ee5e9f00bfa579fb803237f18d83dc011c2015ebc3b6b8d4","schema_version":"1.0","event_id":"sha256:6e684b93b96cad87ee5e9f00bfa579fb803237f18d83dc011c2015ebc3b6b8d4"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:NJXEQBBII4KZQMERPYBB72VOUS","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the packing for triples","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Ehsan Poorhadi, Farshad Fallah, Ramin Javadi","submitted_at":"2019-05-26T14:02:30Z","abstract_excerpt":"For positive integers $n\\geq k\\geq t$, a collection $ \\mathcal{B} $ of $k$-subsets of an $n$-set $ X $ is called a $t$-packing if every $t$-subset of $ X $ appears in at most one set in $\\mathcal{B}$. In this paper, we give some upper and lower bounds for the maximum size of $3$-packings when $n$ is sufficiently larger than $k$. In one case, the upper and lower bounds are equal, in some cases, they differ by at most an additive constant depending only on $k$ and in one case they differ by a linear bound in $ n $."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.10807","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":""},"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-17T23:45:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8Z4HhhjkWEpyVXkqWbUZqd1Rb2fZFx6/onv4Z6suQjw9QK4zmunSi4hbrVrZlec+rMW6ZXeW3SgjM7Ks6by3CA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T06:34:44.603240Z"},"content_sha256":"cd842e39dfb833e35a6ceb465a63e99fa67c373176526d106aede5c6bb3c48c4","schema_version":"1.0","event_id":"sha256:cd842e39dfb833e35a6ceb465a63e99fa67c373176526d106aede5c6bb3c48c4"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NJXEQBBII4KZQMERPYBB72VOUS/bundle.json","state_url":"https://pith.science/pith/NJXEQBBII4KZQMERPYBB72VOUS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NJXEQBBII4KZQMERPYBB72VOUS/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-02T06:34:44Z","links":{"resolver":"https://pith.science/pith/NJXEQBBII4KZQMERPYBB72VOUS","bundle":"https://pith.science/pith/NJXEQBBII4KZQMERPYBB72VOUS/bundle.json","state":"https://pith.science/pith/NJXEQBBII4KZQMERPYBB72VOUS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NJXEQBBII4KZQMERPYBB72VOUS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:NJXEQBBII4KZQMERPYBB72VOUS","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":"eef92bee33d6ffd67977dc5367014cf261b27b28d1a1ab2566a5f7ddf402375c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-05-26T14:02:30Z","title_canon_sha256":"52d3dc128b7860fe452308ab8f9f83670a2d4cdc9fa951ee4ae8e343a690c986"},"schema_version":"1.0","source":{"id":"1905.10807","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1905.10807","created_at":"2026-05-17T23:45:05Z"},{"alias_kind":"arxiv_version","alias_value":"1905.10807v1","created_at":"2026-05-17T23:45:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.10807","created_at":"2026-05-17T23:45:05Z"},{"alias_kind":"pith_short_12","alias_value":"NJXEQBBII4KZ","created_at":"2026-05-18T12:33:24Z"},{"alias_kind":"pith_short_16","alias_value":"NJXEQBBII4KZQMER","created_at":"2026-05-18T12:33:24Z"},{"alias_kind":"pith_short_8","alias_value":"NJXEQBBI","created_at":"2026-05-18T12:33:24Z"}],"graph_snapshots":[{"event_id":"sha256:cd842e39dfb833e35a6ceb465a63e99fa67c373176526d106aede5c6bb3c48c4","target":"graph","created_at":"2026-05-17T23:45:05Z","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":"For positive integers $n\\geq k\\geq t$, a collection $ \\mathcal{B} $ of $k$-subsets of an $n$-set $ X $ is called a $t$-packing if every $t$-subset of $ X $ appears in at most one set in $\\mathcal{B}$. In this paper, we give some upper and lower bounds for the maximum size of $3$-packings when $n$ is sufficiently larger than $k$. In one case, the upper and lower bounds are equal, in some cases, they differ by at most an additive constant depending only on $k$ and in one case they differ by a linear bound in $ n $.","authors_text":"Ehsan Poorhadi, Farshad Fallah, Ramin Javadi","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-05-26T14:02:30Z","title":"On the packing for triples"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.10807","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:6e684b93b96cad87ee5e9f00bfa579fb803237f18d83dc011c2015ebc3b6b8d4","target":"record","created_at":"2026-05-17T23:45:05Z","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":"eef92bee33d6ffd67977dc5367014cf261b27b28d1a1ab2566a5f7ddf402375c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-05-26T14:02:30Z","title_canon_sha256":"52d3dc128b7860fe452308ab8f9f83670a2d4cdc9fa951ee4ae8e343a690c986"},"schema_version":"1.0","source":{"id":"1905.10807","kind":"arxiv","version":1}},"canonical_sha256":"6a6e48042847159830917e021feaaea485f2c3188edfeb12513e912a558c3127","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6a6e48042847159830917e021feaaea485f2c3188edfeb12513e912a558c3127","first_computed_at":"2026-05-17T23:45:05.217372Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:45:05.217372Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ZE6n85Rf4wBsyyHBc4riYe2+369s26xaiBG+EWpSunTxqCevffu9EWs3pWaBXY5OFSYk2hicGa6++PtSU1nQBw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:45:05.218011Z","signed_message":"canonical_sha256_bytes"},"source_id":"1905.10807","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6e684b93b96cad87ee5e9f00bfa579fb803237f18d83dc011c2015ebc3b6b8d4","sha256:cd842e39dfb833e35a6ceb465a63e99fa67c373176526d106aede5c6bb3c48c4"],"state_sha256":"b68849fda027c1bb457267aeca2b5ddb29e6729ecc1053ee4bed1b281a971e17"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fTL28aUUBSbAEA6q4ZYa3Dfhj2KBIcNJ7rGZzKEtEN1pMxKDfwYgAmXpoBFxNrCCVPbt5hwAuTwXlJ854CdVCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T06:34:44.605205Z","bundle_sha256":"f7c167cd4def01c9d43f42d6b33e7b5dbe3b5dd3c6ccd68e93f73a493e08ac58"}}