{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:WD5R2VSTPKQU47R5EGBGHXG4MW","short_pith_number":"pith:WD5R2VST","canonical_record":{"source":{"id":"2503.08406","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2025-03-11T13:10:36Z","cross_cats_sorted":[],"title_canon_sha256":"16c0f9386d960bdd58ef7edab4d582e86d1d27b689f9e66545b0f8e46823e20d","abstract_canon_sha256":"355707d2955646ebe5c82a49181be64bcbbf00592ff3eb2ca29450d89007a49b"},"schema_version":"1.0"},"canonical_sha256":"b0fb1d56537aa14e7e3d218263dcdc65825758bbeca7cd4205ab42f3bc13e4a0","source":{"kind":"arxiv","id":"2503.08406","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2503.08406","created_at":"2026-07-05T10:28:58Z"},{"alias_kind":"arxiv_version","alias_value":"2503.08406v1","created_at":"2026-07-05T10:28:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2503.08406","created_at":"2026-07-05T10:28:58Z"},{"alias_kind":"pith_short_12","alias_value":"WD5R2VSTPKQU","created_at":"2026-07-05T10:28:58Z"},{"alias_kind":"pith_short_16","alias_value":"WD5R2VSTPKQU47R5","created_at":"2026-07-05T10:28:58Z"},{"alias_kind":"pith_short_8","alias_value":"WD5R2VST","created_at":"2026-07-05T10:28:58Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:WD5R2VSTPKQU47R5EGBGHXG4MW","target":"record","payload":{"canonical_record":{"source":{"id":"2503.08406","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2025-03-11T13:10:36Z","cross_cats_sorted":[],"title_canon_sha256":"16c0f9386d960bdd58ef7edab4d582e86d1d27b689f9e66545b0f8e46823e20d","abstract_canon_sha256":"355707d2955646ebe5c82a49181be64bcbbf00592ff3eb2ca29450d89007a49b"},"schema_version":"1.0"},"canonical_sha256":"b0fb1d56537aa14e7e3d218263dcdc65825758bbeca7cd4205ab42f3bc13e4a0","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:28:58.985047Z","signature_b64":"eDrPMJ5DOf1S2mdoySkHChfdgmHdTqrbSdYCo9UeISAYyaSx5n1bASe28J//5R8B/cvhJDrw/5+xoojvKN9QAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b0fb1d56537aa14e7e3d218263dcdc65825758bbeca7cd4205ab42f3bc13e4a0","last_reissued_at":"2026-07-05T10:28:58.984535Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:28:58.984535Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2503.08406","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-07-05T10:28:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8vmC+rfAIZD4KP6606uXRb36RbGyhuKQSxIUxEul5QzVFlg1hw7vY4j7Crw8gdT8XbPh5tZRMiDqMhsCLeLGAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-05T13:24:49.508013Z"},"content_sha256":"bb9612896496e1fbc70d585f4eea8cd0f98d71a85b148a914f57dfce74787e7b","schema_version":"1.0","event_id":"sha256:bb9612896496e1fbc70d585f4eea8cd0f98d71a85b148a914f57dfce74787e7b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:WD5R2VSTPKQU47R5EGBGHXG4MW","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On resilient hypergraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Jian Wang, Peter Frankl","submitted_at":"2025-03-11T13:10:36Z","abstract_excerpt":"The matching number of a $k$-graph is the maximum number of pairwise disjoint edges in it. The $k$-graph is called $t$-resilient if omitting $t$ vertices never decreases its matching number. The complete $k$-graph on $sk+k-1$ vertices has matching number $s$ and it is easily seen to be $(k-1)$-resilient. We conjecture that this is maximal for $k=3$ and $s$ arbitrary. The main result verifies this conjecture for $s=2$. Then Theorem 1.9 provides a considerable improvement on the known upper bounds for $s\\geq 3$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2503.08406","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2503.08406/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-05T10:28:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2ndOtlNt+PfdW2KCTKiB6eGDnZPUidMwgsTgCN2BNDiX72qtrIKOc+UQEJfHjE8h6wyr+t3RlZ49zWTK8jEkAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-05T13:24:49.509033Z"},"content_sha256":"638032dd473016fa5c7d5cd5b559988bd9f31f1bef168d2c42566cdc838197af","schema_version":"1.0","event_id":"sha256:638032dd473016fa5c7d5cd5b559988bd9f31f1bef168d2c42566cdc838197af"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WD5R2VSTPKQU47R5EGBGHXG4MW/bundle.json","state_url":"https://pith.science/pith/WD5R2VSTPKQU47R5EGBGHXG4MW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WD5R2VSTPKQU47R5EGBGHXG4MW/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-05T13:24:49Z","links":{"resolver":"https://pith.science/pith/WD5R2VSTPKQU47R5EGBGHXG4MW","bundle":"https://pith.science/pith/WD5R2VSTPKQU47R5EGBGHXG4MW/bundle.json","state":"https://pith.science/pith/WD5R2VSTPKQU47R5EGBGHXG4MW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WD5R2VSTPKQU47R5EGBGHXG4MW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:WD5R2VSTPKQU47R5EGBGHXG4MW","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":"355707d2955646ebe5c82a49181be64bcbbf00592ff3eb2ca29450d89007a49b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2025-03-11T13:10:36Z","title_canon_sha256":"16c0f9386d960bdd58ef7edab4d582e86d1d27b689f9e66545b0f8e46823e20d"},"schema_version":"1.0","source":{"id":"2503.08406","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2503.08406","created_at":"2026-07-05T10:28:58Z"},{"alias_kind":"arxiv_version","alias_value":"2503.08406v1","created_at":"2026-07-05T10:28:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2503.08406","created_at":"2026-07-05T10:28:58Z"},{"alias_kind":"pith_short_12","alias_value":"WD5R2VSTPKQU","created_at":"2026-07-05T10:28:58Z"},{"alias_kind":"pith_short_16","alias_value":"WD5R2VSTPKQU47R5","created_at":"2026-07-05T10:28:58Z"},{"alias_kind":"pith_short_8","alias_value":"WD5R2VST","created_at":"2026-07-05T10:28:58Z"}],"graph_snapshots":[{"event_id":"sha256:638032dd473016fa5c7d5cd5b559988bd9f31f1bef168d2c42566cdc838197af","target":"graph","created_at":"2026-07-05T10:28:58Z","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/2503.08406/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"The matching number of a $k$-graph is the maximum number of pairwise disjoint edges in it. The $k$-graph is called $t$-resilient if omitting $t$ vertices never decreases its matching number. The complete $k$-graph on $sk+k-1$ vertices has matching number $s$ and it is easily seen to be $(k-1)$-resilient. We conjecture that this is maximal for $k=3$ and $s$ arbitrary. The main result verifies this conjecture for $s=2$. Then Theorem 1.9 provides a considerable improvement on the known upper bounds for $s\\geq 3$.","authors_text":"Jian Wang, Peter Frankl","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2025-03-11T13:10:36Z","title":"On resilient hypergraphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2503.08406","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:bb9612896496e1fbc70d585f4eea8cd0f98d71a85b148a914f57dfce74787e7b","target":"record","created_at":"2026-07-05T10:28:58Z","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":"355707d2955646ebe5c82a49181be64bcbbf00592ff3eb2ca29450d89007a49b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2025-03-11T13:10:36Z","title_canon_sha256":"16c0f9386d960bdd58ef7edab4d582e86d1d27b689f9e66545b0f8e46823e20d"},"schema_version":"1.0","source":{"id":"2503.08406","kind":"arxiv","version":1}},"canonical_sha256":"b0fb1d56537aa14e7e3d218263dcdc65825758bbeca7cd4205ab42f3bc13e4a0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b0fb1d56537aa14e7e3d218263dcdc65825758bbeca7cd4205ab42f3bc13e4a0","first_computed_at":"2026-07-05T10:28:58.984535Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T10:28:58.984535Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"eDrPMJ5DOf1S2mdoySkHChfdgmHdTqrbSdYCo9UeISAYyaSx5n1bASe28J//5R8B/cvhJDrw/5+xoojvKN9QAw==","signature_status":"signed_v1","signed_at":"2026-07-05T10:28:58.985047Z","signed_message":"canonical_sha256_bytes"},"source_id":"2503.08406","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:bb9612896496e1fbc70d585f4eea8cd0f98d71a85b148a914f57dfce74787e7b","sha256:638032dd473016fa5c7d5cd5b559988bd9f31f1bef168d2c42566cdc838197af"],"state_sha256":"c7b0836bd98bdda4502d7475f4e79f3925f71c5227ae1a472e2085ad3b22caaf"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2+Gto0HIb6ibwZ2Ce87V6F+n6GuPKO+muQu35cftYc/lB4yQA5sqT0FavXd9BSx7SIZAWJoPO/C3bi6wzxo5Bw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-05T13:24:49.536583Z","bundle_sha256":"4e349e6b064bbdd77986ba641d00ab550e26a4db9e0ea7998cb8619cfef6a7c6"}}