{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:5DGGQYG6BK33V6MARLYECHUH57","short_pith_number":"pith:5DGGQYG6","canonical_record":{"source":{"id":"1709.07208","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-09-21T08:28:09Z","cross_cats_sorted":[],"title_canon_sha256":"d5d65df2f540d339bef6452b1f347b0e89e389ce9012ecb0311f87c7e1695089","abstract_canon_sha256":"935ce65800a70f83de8020a5ab3dbdec00c33f3b304bf3e6d4f6bd72b87e4751"},"schema_version":"1.0"},"canonical_sha256":"e8cc6860de0ab7baf9808af0411e87eff4b103b8558fab8875ddd4803e6df858","source":{"kind":"arxiv","id":"1709.07208","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1709.07208","created_at":"2026-05-18T00:34:36Z"},{"alias_kind":"arxiv_version","alias_value":"1709.07208v1","created_at":"2026-05-18T00:34:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.07208","created_at":"2026-05-18T00:34:36Z"},{"alias_kind":"pith_short_12","alias_value":"5DGGQYG6BK33","created_at":"2026-05-18T12:31:00Z"},{"alias_kind":"pith_short_16","alias_value":"5DGGQYG6BK33V6MA","created_at":"2026-05-18T12:31:00Z"},{"alias_kind":"pith_short_8","alias_value":"5DGGQYG6","created_at":"2026-05-18T12:31:00Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:5DGGQYG6BK33V6MARLYECHUH57","target":"record","payload":{"canonical_record":{"source":{"id":"1709.07208","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-09-21T08:28:09Z","cross_cats_sorted":[],"title_canon_sha256":"d5d65df2f540d339bef6452b1f347b0e89e389ce9012ecb0311f87c7e1695089","abstract_canon_sha256":"935ce65800a70f83de8020a5ab3dbdec00c33f3b304bf3e6d4f6bd72b87e4751"},"schema_version":"1.0"},"canonical_sha256":"e8cc6860de0ab7baf9808af0411e87eff4b103b8558fab8875ddd4803e6df858","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:34:36.304064Z","signature_b64":"ZpnU+hc39HXsJgjbUeU+dQmfEexqURVHjcU/Rl+Vg3iSa6D6wuC7wlULU272P5IIKdbCJc0nmUR4CRRQioQtAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e8cc6860de0ab7baf9808af0411e87eff4b103b8558fab8875ddd4803e6df858","last_reissued_at":"2026-05-18T00:34:36.303560Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:34:36.303560Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1709.07208","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-18T00:34:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Ua3NN/4hoz/wg1EmJeuAanX658VwyWr1YeKhbFKdtRnmzyaYR9g6I4M+Lhco7b9JTaZW0a/JdlND7dPEOBmwDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T01:49:07.276940Z"},"content_sha256":"676cfcebe4e56a5b85757749770e34dce69b3e6a9cbfef770cda73f647ccf8ae","schema_version":"1.0","event_id":"sha256:676cfcebe4e56a5b85757749770e34dce69b3e6a9cbfef770cda73f647ccf8ae"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:5DGGQYG6BK33V6MARLYECHUH57","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The size of $3$-uniform hypergraphs with given matching number and codegree","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Boyuan Liu, Jun Gao, Lei Yu, Xinmin Hou","submitted_at":"2017-09-21T08:28:09Z","abstract_excerpt":"Determine the size of $r$-graphs with given graph parameters is an interesting problem. Chv\\'atal and Hanson (JCTB, 1976) gave a tight upper bound of the size of 2-graphs with restricted maximum degree and matching number; Khare (DM, 2014) studied the same problem for linear $3$-graphs with restricted matching number and maximum degree. In this paper, we give a tight upper bound of the size of $3$-graphs with bounded codegree and matching number."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.07208","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-18T00:34:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HvbANxA5GSq1wXUNt45rl2EQsHJxzJJTxzhzvv5r7FFTLIVjROlyl2T8cgXf6OuwSAtkiUs5jp3oHL76N/3SDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T01:49:07.277277Z"},"content_sha256":"5f5df224523f643385346d8665832fd31ee1cd326d65f59cbdb13cb5ae899544","schema_version":"1.0","event_id":"sha256:5f5df224523f643385346d8665832fd31ee1cd326d65f59cbdb13cb5ae899544"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5DGGQYG6BK33V6MARLYECHUH57/bundle.json","state_url":"https://pith.science/pith/5DGGQYG6BK33V6MARLYECHUH57/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5DGGQYG6BK33V6MARLYECHUH57/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-02T01:49:07Z","links":{"resolver":"https://pith.science/pith/5DGGQYG6BK33V6MARLYECHUH57","bundle":"https://pith.science/pith/5DGGQYG6BK33V6MARLYECHUH57/bundle.json","state":"https://pith.science/pith/5DGGQYG6BK33V6MARLYECHUH57/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5DGGQYG6BK33V6MARLYECHUH57/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:5DGGQYG6BK33V6MARLYECHUH57","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":"935ce65800a70f83de8020a5ab3dbdec00c33f3b304bf3e6d4f6bd72b87e4751","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-09-21T08:28:09Z","title_canon_sha256":"d5d65df2f540d339bef6452b1f347b0e89e389ce9012ecb0311f87c7e1695089"},"schema_version":"1.0","source":{"id":"1709.07208","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1709.07208","created_at":"2026-05-18T00:34:36Z"},{"alias_kind":"arxiv_version","alias_value":"1709.07208v1","created_at":"2026-05-18T00:34:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.07208","created_at":"2026-05-18T00:34:36Z"},{"alias_kind":"pith_short_12","alias_value":"5DGGQYG6BK33","created_at":"2026-05-18T12:31:00Z"},{"alias_kind":"pith_short_16","alias_value":"5DGGQYG6BK33V6MA","created_at":"2026-05-18T12:31:00Z"},{"alias_kind":"pith_short_8","alias_value":"5DGGQYG6","created_at":"2026-05-18T12:31:00Z"}],"graph_snapshots":[{"event_id":"sha256:5f5df224523f643385346d8665832fd31ee1cd326d65f59cbdb13cb5ae899544","target":"graph","created_at":"2026-05-18T00:34: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":"Determine the size of $r$-graphs with given graph parameters is an interesting problem. Chv\\'atal and Hanson (JCTB, 1976) gave a tight upper bound of the size of 2-graphs with restricted maximum degree and matching number; Khare (DM, 2014) studied the same problem for linear $3$-graphs with restricted matching number and maximum degree. In this paper, we give a tight upper bound of the size of $3$-graphs with bounded codegree and matching number.","authors_text":"Boyuan Liu, Jun Gao, Lei Yu, Xinmin Hou","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-09-21T08:28:09Z","title":"The size of $3$-uniform hypergraphs with given matching number and codegree"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.07208","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:676cfcebe4e56a5b85757749770e34dce69b3e6a9cbfef770cda73f647ccf8ae","target":"record","created_at":"2026-05-18T00:34: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":"935ce65800a70f83de8020a5ab3dbdec00c33f3b304bf3e6d4f6bd72b87e4751","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-09-21T08:28:09Z","title_canon_sha256":"d5d65df2f540d339bef6452b1f347b0e89e389ce9012ecb0311f87c7e1695089"},"schema_version":"1.0","source":{"id":"1709.07208","kind":"arxiv","version":1}},"canonical_sha256":"e8cc6860de0ab7baf9808af0411e87eff4b103b8558fab8875ddd4803e6df858","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e8cc6860de0ab7baf9808af0411e87eff4b103b8558fab8875ddd4803e6df858","first_computed_at":"2026-05-18T00:34:36.303560Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:34:36.303560Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ZpnU+hc39HXsJgjbUeU+dQmfEexqURVHjcU/Rl+Vg3iSa6D6wuC7wlULU272P5IIKdbCJc0nmUR4CRRQioQtAg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:34:36.304064Z","signed_message":"canonical_sha256_bytes"},"source_id":"1709.07208","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:676cfcebe4e56a5b85757749770e34dce69b3e6a9cbfef770cda73f647ccf8ae","sha256:5f5df224523f643385346d8665832fd31ee1cd326d65f59cbdb13cb5ae899544"],"state_sha256":"501a4a23849ea302a5612673301eb3bed07f4f2735d600c7c91af463a6c32737"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LO4Z1hgFghgHJioXJyYqgVraFpAlYC/ra0yK2c3Dn8WEgM9IXcmHgq1YL4GW8/nv+ZLb81fUaCtGtvaUIclECQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T01:49:07.279345Z","bundle_sha256":"7f06c9c6cdb5a713a0917477dbdd6432c22d3ac02499d77c31de37b9805b5143"}}