{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:F63ERL5RYYIWXMVEQ47ONC5EVL","short_pith_number":"pith:F63ERL5R","canonical_record":{"source":{"id":"1708.01607","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-08-04T17:58:30Z","cross_cats_sorted":[],"title_canon_sha256":"a0846ff807c8ef96e29f8c7a53ff84334180524cb5a48bcf716fe5edf080a053","abstract_canon_sha256":"f376f937eb783300708838090bfdff00f6118d5cade5be1e34c9290db07b87e4"},"schema_version":"1.0"},"canonical_sha256":"2fb648afb1c6116bb2a4873ee68ba4aace1a5be1c00d3fc24efe6146397b9584","source":{"kind":"arxiv","id":"1708.01607","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1708.01607","created_at":"2026-05-18T00:32:00Z"},{"alias_kind":"arxiv_version","alias_value":"1708.01607v2","created_at":"2026-05-18T00:32:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.01607","created_at":"2026-05-18T00:32:00Z"},{"alias_kind":"pith_short_12","alias_value":"F63ERL5RYYIW","created_at":"2026-05-18T12:31:15Z"},{"alias_kind":"pith_short_16","alias_value":"F63ERL5RYYIWXMVE","created_at":"2026-05-18T12:31:15Z"},{"alias_kind":"pith_short_8","alias_value":"F63ERL5R","created_at":"2026-05-18T12:31:15Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:F63ERL5RYYIWXMVEQ47ONC5EVL","target":"record","payload":{"canonical_record":{"source":{"id":"1708.01607","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-08-04T17:58:30Z","cross_cats_sorted":[],"title_canon_sha256":"a0846ff807c8ef96e29f8c7a53ff84334180524cb5a48bcf716fe5edf080a053","abstract_canon_sha256":"f376f937eb783300708838090bfdff00f6118d5cade5be1e34c9290db07b87e4"},"schema_version":"1.0"},"canonical_sha256":"2fb648afb1c6116bb2a4873ee68ba4aace1a5be1c00d3fc24efe6146397b9584","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:32:00.991479Z","signature_b64":"EGVdRiBfSlZgSIKX6zXyA/pCy0PzFNvv30eO2iPTLNjIAZ/ejcoK3mksFAm/TQub/6TC4W8h6DjyvkdkeWsZDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2fb648afb1c6116bb2a4873ee68ba4aace1a5be1c00d3fc24efe6146397b9584","last_reissued_at":"2026-05-18T00:32:00.991022Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:32:00.991022Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1708.01607","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-18T00:32:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vxKyki7RfVpjjip08Q9PqJseZfsXVoXkZtkIy1j4i+WcNdNND1IjynVjwfEOLqzYCQjcsjmvBQ7ZEFz/rZ8IDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T11:11:56.106232Z"},"content_sha256":"37b7a0b37bc98a64d0baa73833421da56f434f5bee26cab1b09f9247024d5a3d","schema_version":"1.0","event_id":"sha256:37b7a0b37bc98a64d0baa73833421da56f434f5bee26cab1b09f9247024d5a3d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:F63ERL5RYYIWXMVEQ47ONC5EVL","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Partite Saturation of Complete Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Ant\\'onio Gir\\~ao, Kamil Popielarz, Teeradej Kittipassorn","submitted_at":"2017-08-04T17:58:30Z","abstract_excerpt":"We study the problem of determining $sat(n,k,r)$, the minimum number of edges in a $k$-partite graph $G$ with $n$ vertices in each part such that $G$ is $K_r$-free but the addition of an edge joining any two non-adjacent vertices from different parts creates a $K_r$. Improving recent results of Ferrara, Jacobson, Pfender and Wenger, and generalizing a recent result of Roberts, we define a function $\\alpha(k,r)$ such that $sat(n,k,r) = \\alpha(k,r)n + o(n)$ as $n \\rightarrow \\infty$. Moreover, we prove that \\[ k(2r-4) \\le \\alpha(k,r) \\le \\begin{cases} (k-1)(4r-k-6) &\\text{ for }r \\le k \\le 2r-3,"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.01607","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-18T00:32:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dsBO6f/WkkuG6csU/mT5YQevuduqG+FKLjkz48bnIueh8u5ZX9bD+Ez4Xi7BgXi9duwyL3JNwVbPHcn4StePDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T11:11:56.106591Z"},"content_sha256":"f51ccc17a5ccd04f97aa73f57298ec0f260aff6d44485f98edc6cf6d0b4623d8","schema_version":"1.0","event_id":"sha256:f51ccc17a5ccd04f97aa73f57298ec0f260aff6d44485f98edc6cf6d0b4623d8"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/F63ERL5RYYIWXMVEQ47ONC5EVL/bundle.json","state_url":"https://pith.science/pith/F63ERL5RYYIWXMVEQ47ONC5EVL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/F63ERL5RYYIWXMVEQ47ONC5EVL/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-22T11:11:56Z","links":{"resolver":"https://pith.science/pith/F63ERL5RYYIWXMVEQ47ONC5EVL","bundle":"https://pith.science/pith/F63ERL5RYYIWXMVEQ47ONC5EVL/bundle.json","state":"https://pith.science/pith/F63ERL5RYYIWXMVEQ47ONC5EVL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/F63ERL5RYYIWXMVEQ47ONC5EVL/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:F63ERL5RYYIWXMVEQ47ONC5EVL","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":"f376f937eb783300708838090bfdff00f6118d5cade5be1e34c9290db07b87e4","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-08-04T17:58:30Z","title_canon_sha256":"a0846ff807c8ef96e29f8c7a53ff84334180524cb5a48bcf716fe5edf080a053"},"schema_version":"1.0","source":{"id":"1708.01607","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1708.01607","created_at":"2026-05-18T00:32:00Z"},{"alias_kind":"arxiv_version","alias_value":"1708.01607v2","created_at":"2026-05-18T00:32:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.01607","created_at":"2026-05-18T00:32:00Z"},{"alias_kind":"pith_short_12","alias_value":"F63ERL5RYYIW","created_at":"2026-05-18T12:31:15Z"},{"alias_kind":"pith_short_16","alias_value":"F63ERL5RYYIWXMVE","created_at":"2026-05-18T12:31:15Z"},{"alias_kind":"pith_short_8","alias_value":"F63ERL5R","created_at":"2026-05-18T12:31:15Z"}],"graph_snapshots":[{"event_id":"sha256:f51ccc17a5ccd04f97aa73f57298ec0f260aff6d44485f98edc6cf6d0b4623d8","target":"graph","created_at":"2026-05-18T00:32:00Z","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":"We study the problem of determining $sat(n,k,r)$, the minimum number of edges in a $k$-partite graph $G$ with $n$ vertices in each part such that $G$ is $K_r$-free but the addition of an edge joining any two non-adjacent vertices from different parts creates a $K_r$. Improving recent results of Ferrara, Jacobson, Pfender and Wenger, and generalizing a recent result of Roberts, we define a function $\\alpha(k,r)$ such that $sat(n,k,r) = \\alpha(k,r)n + o(n)$ as $n \\rightarrow \\infty$. Moreover, we prove that \\[ k(2r-4) \\le \\alpha(k,r) \\le \\begin{cases} (k-1)(4r-k-6) &\\text{ for }r \\le k \\le 2r-3,","authors_text":"Ant\\'onio Gir\\~ao, Kamil Popielarz, Teeradej Kittipassorn","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-08-04T17:58:30Z","title":"Partite Saturation of Complete Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.01607","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:37b7a0b37bc98a64d0baa73833421da56f434f5bee26cab1b09f9247024d5a3d","target":"record","created_at":"2026-05-18T00:32:00Z","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":"f376f937eb783300708838090bfdff00f6118d5cade5be1e34c9290db07b87e4","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-08-04T17:58:30Z","title_canon_sha256":"a0846ff807c8ef96e29f8c7a53ff84334180524cb5a48bcf716fe5edf080a053"},"schema_version":"1.0","source":{"id":"1708.01607","kind":"arxiv","version":2}},"canonical_sha256":"2fb648afb1c6116bb2a4873ee68ba4aace1a5be1c00d3fc24efe6146397b9584","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2fb648afb1c6116bb2a4873ee68ba4aace1a5be1c00d3fc24efe6146397b9584","first_computed_at":"2026-05-18T00:32:00.991022Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:32:00.991022Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"EGVdRiBfSlZgSIKX6zXyA/pCy0PzFNvv30eO2iPTLNjIAZ/ejcoK3mksFAm/TQub/6TC4W8h6DjyvkdkeWsZDw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:32:00.991479Z","signed_message":"canonical_sha256_bytes"},"source_id":"1708.01607","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:37b7a0b37bc98a64d0baa73833421da56f434f5bee26cab1b09f9247024d5a3d","sha256:f51ccc17a5ccd04f97aa73f57298ec0f260aff6d44485f98edc6cf6d0b4623d8"],"state_sha256":"80591634ff6c36b65ebd0d322955cadf2daa9a1a6e448847499bbde3a2550381"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5wX2E03FnaEL0LHljnx+EoJxk4LrxTTDiIejpgyzDoJqRDk2ReZQRozdIw6IRijf8QT+fvanRv7N4KmxciGiCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-22T11:11:56.108443Z","bundle_sha256":"3608d8aba4df330dcd8dc8cddda08e70364f42ebe624130388d1cb8b3b171e41"}}