{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:4UDZYG7JND2KL2ECYT5XAV4SKU","short_pith_number":"pith:4UDZYG7J","canonical_record":{"source":{"id":"1504.01829","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-04-08T04:38:52Z","cross_cats_sorted":[],"title_canon_sha256":"68507f588113279293a8bdd810945cd712e4f489243354b21153202f285a4ae4","abstract_canon_sha256":"664c2e57bcd74ece0f4f0501da75ec10bde206395ab014ad86e9f2d2db7efeeb"},"schema_version":"1.0"},"canonical_sha256":"e5079c1be968f4a5e882c4fb705792551e5d5283e65e92504d27957f5702e44a","source":{"kind":"arxiv","id":"1504.01829","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1504.01829","created_at":"2026-05-18T01:12:18Z"},{"alias_kind":"arxiv_version","alias_value":"1504.01829v2","created_at":"2026-05-18T01:12:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.01829","created_at":"2026-05-18T01:12:18Z"},{"alias_kind":"pith_short_12","alias_value":"4UDZYG7JND2K","created_at":"2026-05-18T12:29:05Z"},{"alias_kind":"pith_short_16","alias_value":"4UDZYG7JND2KL2EC","created_at":"2026-05-18T12:29:05Z"},{"alias_kind":"pith_short_8","alias_value":"4UDZYG7J","created_at":"2026-05-18T12:29:05Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:4UDZYG7JND2KL2ECYT5XAV4SKU","target":"record","payload":{"canonical_record":{"source":{"id":"1504.01829","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-04-08T04:38:52Z","cross_cats_sorted":[],"title_canon_sha256":"68507f588113279293a8bdd810945cd712e4f489243354b21153202f285a4ae4","abstract_canon_sha256":"664c2e57bcd74ece0f4f0501da75ec10bde206395ab014ad86e9f2d2db7efeeb"},"schema_version":"1.0"},"canonical_sha256":"e5079c1be968f4a5e882c4fb705792551e5d5283e65e92504d27957f5702e44a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:12:18.506539Z","signature_b64":"dI9LXXSAFfiY32eIhbj3dW69V90/o7ARCTeCAC8uYLtaKHd+SM7MBHl9abs8TjJBingArG7dCsLnAO6hmXdsDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e5079c1be968f4a5e882c4fb705792551e5d5283e65e92504d27957f5702e44a","last_reissued_at":"2026-05-18T01:12:18.506198Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:12:18.506198Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1504.01829","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-18T01:12:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FOqzny90j6zjjko5mQBod45eXBjPzp2ZEtE7drYusKrmdBhCWZ/UKVpFeNLDPXCmn9v2bDJkTwZCPIS3aEAtDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T12:40:45.932124Z"},"content_sha256":"db6aa1455779c9adeb889f2a5231ebc4791f21923ff75bbab4e5234d96be2f67","schema_version":"1.0","event_id":"sha256:db6aa1455779c9adeb889f2a5231ebc4791f21923ff75bbab4e5234d96be2f67"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:4UDZYG7JND2KL2ECYT5XAV4SKU","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Small Cores in 3-uniform Hypergraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"David Solymosi, Jozsef Solymosi","submitted_at":"2015-04-08T04:38:52Z","abstract_excerpt":"The main result of this paper is that for any $c>0$ and for large enough $n$ if the number of edges in a 3-uniform hypergraph is at least $cn^2$ then there is a core (subgraph with minimum degree at least 2) on at most 15 vertices. We conjecture that our result is not sharp and 15 can be replaced by 9. Such an improvement seems to be out of reach, since it would imply the following case of a long-standing conjecture by Brown, Erd\\H os, and S\\'os; if there is no set of 9 vertices that span at least 6 edges of a 3-uniform hypergraph then it is sparse."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1504.01829","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-18T01:12:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GSCPNw0Op5WHnv5AiD6n0EbIgFuolb5opk3mePnf29AwEcSm3J0VDqznxhnLBNdlN6VL81L2Wm4L585TZhHgDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T12:40:45.932484Z"},"content_sha256":"8ed21e99b65a08a35d838a52147b4652b221b27c10b8bd63cc1b1634aa2e271b","schema_version":"1.0","event_id":"sha256:8ed21e99b65a08a35d838a52147b4652b221b27c10b8bd63cc1b1634aa2e271b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4UDZYG7JND2KL2ECYT5XAV4SKU/bundle.json","state_url":"https://pith.science/pith/4UDZYG7JND2KL2ECYT5XAV4SKU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4UDZYG7JND2KL2ECYT5XAV4SKU/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-04T12:40:45Z","links":{"resolver":"https://pith.science/pith/4UDZYG7JND2KL2ECYT5XAV4SKU","bundle":"https://pith.science/pith/4UDZYG7JND2KL2ECYT5XAV4SKU/bundle.json","state":"https://pith.science/pith/4UDZYG7JND2KL2ECYT5XAV4SKU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4UDZYG7JND2KL2ECYT5XAV4SKU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:4UDZYG7JND2KL2ECYT5XAV4SKU","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":"664c2e57bcd74ece0f4f0501da75ec10bde206395ab014ad86e9f2d2db7efeeb","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-04-08T04:38:52Z","title_canon_sha256":"68507f588113279293a8bdd810945cd712e4f489243354b21153202f285a4ae4"},"schema_version":"1.0","source":{"id":"1504.01829","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1504.01829","created_at":"2026-05-18T01:12:18Z"},{"alias_kind":"arxiv_version","alias_value":"1504.01829v2","created_at":"2026-05-18T01:12:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.01829","created_at":"2026-05-18T01:12:18Z"},{"alias_kind":"pith_short_12","alias_value":"4UDZYG7JND2K","created_at":"2026-05-18T12:29:05Z"},{"alias_kind":"pith_short_16","alias_value":"4UDZYG7JND2KL2EC","created_at":"2026-05-18T12:29:05Z"},{"alias_kind":"pith_short_8","alias_value":"4UDZYG7J","created_at":"2026-05-18T12:29:05Z"}],"graph_snapshots":[{"event_id":"sha256:8ed21e99b65a08a35d838a52147b4652b221b27c10b8bd63cc1b1634aa2e271b","target":"graph","created_at":"2026-05-18T01:12:18Z","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":"The main result of this paper is that for any $c>0$ and for large enough $n$ if the number of edges in a 3-uniform hypergraph is at least $cn^2$ then there is a core (subgraph with minimum degree at least 2) on at most 15 vertices. We conjecture that our result is not sharp and 15 can be replaced by 9. Such an improvement seems to be out of reach, since it would imply the following case of a long-standing conjecture by Brown, Erd\\H os, and S\\'os; if there is no set of 9 vertices that span at least 6 edges of a 3-uniform hypergraph then it is sparse.","authors_text":"David Solymosi, Jozsef Solymosi","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-04-08T04:38:52Z","title":"Small Cores in 3-uniform Hypergraphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1504.01829","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:db6aa1455779c9adeb889f2a5231ebc4791f21923ff75bbab4e5234d96be2f67","target":"record","created_at":"2026-05-18T01:12:18Z","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":"664c2e57bcd74ece0f4f0501da75ec10bde206395ab014ad86e9f2d2db7efeeb","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-04-08T04:38:52Z","title_canon_sha256":"68507f588113279293a8bdd810945cd712e4f489243354b21153202f285a4ae4"},"schema_version":"1.0","source":{"id":"1504.01829","kind":"arxiv","version":2}},"canonical_sha256":"e5079c1be968f4a5e882c4fb705792551e5d5283e65e92504d27957f5702e44a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e5079c1be968f4a5e882c4fb705792551e5d5283e65e92504d27957f5702e44a","first_computed_at":"2026-05-18T01:12:18.506198Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:12:18.506198Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"dI9LXXSAFfiY32eIhbj3dW69V90/o7ARCTeCAC8uYLtaKHd+SM7MBHl9abs8TjJBingArG7dCsLnAO6hmXdsDg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:12:18.506539Z","signed_message":"canonical_sha256_bytes"},"source_id":"1504.01829","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:db6aa1455779c9adeb889f2a5231ebc4791f21923ff75bbab4e5234d96be2f67","sha256:8ed21e99b65a08a35d838a52147b4652b221b27c10b8bd63cc1b1634aa2e271b"],"state_sha256":"3d7333607dc3e890a23d6e89cce1f93e348ed89c1053b40789e3092e6f1e5805"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bj9+tnDwbHFZ9dUFiB7Ns3cz+m0bcEqx8atOX9E+Xds0YEEfa/lTwQF4dPyCkc+P3g78ZdAEnbHuU6G4AVtECw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T12:40:45.934413Z","bundle_sha256":"98218f3939039d566b3fc355e3c6a17b0be6f919cb630b1d268152186e9d8666"}}