{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:BZEEQABQNUVPHTKFJS3MFBGYNK","short_pith_number":"pith:BZEEQABQ","canonical_record":{"source":{"id":"2412.12659","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2024-12-17T08:27:47Z","cross_cats_sorted":[],"title_canon_sha256":"20a5a4c054fdee3c0a1872c19232204002a896206e4649e5bf65c46bc72ec7d3","abstract_canon_sha256":"1bdc36eb517df306a01b958594bc5e4b1be2f37617f6497098281501f6313e27"},"schema_version":"1.0"},"canonical_sha256":"0e484800306d2af3cd454cb6c284d86a9642273382dcca2965e752489543f1e9","source":{"kind":"arxiv","id":"2412.12659","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2412.12659","created_at":"2026-07-05T09:50:18Z"},{"alias_kind":"arxiv_version","alias_value":"2412.12659v1","created_at":"2026-07-05T09:50:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2412.12659","created_at":"2026-07-05T09:50:18Z"},{"alias_kind":"pith_short_12","alias_value":"BZEEQABQNUVP","created_at":"2026-07-05T09:50:18Z"},{"alias_kind":"pith_short_16","alias_value":"BZEEQABQNUVPHTKF","created_at":"2026-07-05T09:50:18Z"},{"alias_kind":"pith_short_8","alias_value":"BZEEQABQ","created_at":"2026-07-05T09:50:18Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:BZEEQABQNUVPHTKFJS3MFBGYNK","target":"record","payload":{"canonical_record":{"source":{"id":"2412.12659","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2024-12-17T08:27:47Z","cross_cats_sorted":[],"title_canon_sha256":"20a5a4c054fdee3c0a1872c19232204002a896206e4649e5bf65c46bc72ec7d3","abstract_canon_sha256":"1bdc36eb517df306a01b958594bc5e4b1be2f37617f6497098281501f6313e27"},"schema_version":"1.0"},"canonical_sha256":"0e484800306d2af3cd454cb6c284d86a9642273382dcca2965e752489543f1e9","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:50:18.716865Z","signature_b64":"/qawZhcdOa4rBvwDh1cYvQgz2j1fr/3onlFMi3frZngmNZy4tEhhU7JmhUBek48Ikg3YA4EsmzU7BcQWTjSGCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0e484800306d2af3cd454cb6c284d86a9642273382dcca2965e752489543f1e9","last_reissued_at":"2026-07-05T09:50:18.716396Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:50:18.716396Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2412.12659","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-05T09:50:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0+/CmGMq+uBGFxKiU5vg3irNOGwai6/nD7Linqu1vNkUS8KUaaWYlil5McDNxVpP8AHPVxhPgy00WZrJFLNJBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-05T21:33:49.533212Z"},"content_sha256":"987ff5d515f63465bd20f24bcb69b380c09f8a7248ab440e9d9c9df2f1e29973","schema_version":"1.0","event_id":"sha256:987ff5d515f63465bd20f24bcb69b380c09f8a7248ab440e9d9c9df2f1e29973"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:BZEEQABQNUVPHTKFJS3MFBGYNK","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Constructions of minimally $t$-tough regular graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Chengli Li, Feng Liu, Kun Cheng","submitted_at":"2024-12-17T08:27:47Z","abstract_excerpt":"A non-complete graph $G$ is said to be $t$-tough if for every vertex cut $S$ of $G$, the ratio of $|S|$ to the number of components of $G-S$ is at least $t$. The toughness $\\tau(G)$ of the graph $G$ is the maximum value of $t$ such that $G$ is $t$-tough. A graph $G$ is said to be minimally $t$-tough if $\\tau(G)=t$ and $\\tau(G-e)<t$ for every $e\\in E(G)$. In 2003, Kriesell conjectured that every minimally $1$-tough graph contains a vertex of degree $2$. In 2018, Katona and Varga generalized this conjecture, asserting that every minimally $t$-tough graph contains a vertex of degree $\\lceil 2t \\r"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2412.12659","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/2412.12659/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-05T09:50:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aywV4UwlzbKV+7zxJPBJaxRAGZCpJx2Zvlq8+eNCeM7Z4cp5jhy9WvSLSiEordEqpardI9CwGYH2/u1gjsj2BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-05T21:33:49.533710Z"},"content_sha256":"13310be7b627ef7d3f1e19776483e9caae1bf2db282019f41ca85fe2f8ff9658","schema_version":"1.0","event_id":"sha256:13310be7b627ef7d3f1e19776483e9caae1bf2db282019f41ca85fe2f8ff9658"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BZEEQABQNUVPHTKFJS3MFBGYNK/bundle.json","state_url":"https://pith.science/pith/BZEEQABQNUVPHTKFJS3MFBGYNK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BZEEQABQNUVPHTKFJS3MFBGYNK/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-05T21:33:49Z","links":{"resolver":"https://pith.science/pith/BZEEQABQNUVPHTKFJS3MFBGYNK","bundle":"https://pith.science/pith/BZEEQABQNUVPHTKFJS3MFBGYNK/bundle.json","state":"https://pith.science/pith/BZEEQABQNUVPHTKFJS3MFBGYNK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BZEEQABQNUVPHTKFJS3MFBGYNK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:BZEEQABQNUVPHTKFJS3MFBGYNK","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":"1bdc36eb517df306a01b958594bc5e4b1be2f37617f6497098281501f6313e27","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2024-12-17T08:27:47Z","title_canon_sha256":"20a5a4c054fdee3c0a1872c19232204002a896206e4649e5bf65c46bc72ec7d3"},"schema_version":"1.0","source":{"id":"2412.12659","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2412.12659","created_at":"2026-07-05T09:50:18Z"},{"alias_kind":"arxiv_version","alias_value":"2412.12659v1","created_at":"2026-07-05T09:50:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2412.12659","created_at":"2026-07-05T09:50:18Z"},{"alias_kind":"pith_short_12","alias_value":"BZEEQABQNUVP","created_at":"2026-07-05T09:50:18Z"},{"alias_kind":"pith_short_16","alias_value":"BZEEQABQNUVPHTKF","created_at":"2026-07-05T09:50:18Z"},{"alias_kind":"pith_short_8","alias_value":"BZEEQABQ","created_at":"2026-07-05T09:50:18Z"}],"graph_snapshots":[{"event_id":"sha256:13310be7b627ef7d3f1e19776483e9caae1bf2db282019f41ca85fe2f8ff9658","target":"graph","created_at":"2026-07-05T09:50: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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2412.12659/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"A non-complete graph $G$ is said to be $t$-tough if for every vertex cut $S$ of $G$, the ratio of $|S|$ to the number of components of $G-S$ is at least $t$. The toughness $\\tau(G)$ of the graph $G$ is the maximum value of $t$ such that $G$ is $t$-tough. A graph $G$ is said to be minimally $t$-tough if $\\tau(G)=t$ and $\\tau(G-e)<t$ for every $e\\in E(G)$. In 2003, Kriesell conjectured that every minimally $1$-tough graph contains a vertex of degree $2$. In 2018, Katona and Varga generalized this conjecture, asserting that every minimally $t$-tough graph contains a vertex of degree $\\lceil 2t \\r","authors_text":"Chengli Li, Feng Liu, Kun Cheng","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2024-12-17T08:27:47Z","title":"Constructions of minimally $t$-tough regular graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2412.12659","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:987ff5d515f63465bd20f24bcb69b380c09f8a7248ab440e9d9c9df2f1e29973","target":"record","created_at":"2026-07-05T09:50: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":"1bdc36eb517df306a01b958594bc5e4b1be2f37617f6497098281501f6313e27","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2024-12-17T08:27:47Z","title_canon_sha256":"20a5a4c054fdee3c0a1872c19232204002a896206e4649e5bf65c46bc72ec7d3"},"schema_version":"1.0","source":{"id":"2412.12659","kind":"arxiv","version":1}},"canonical_sha256":"0e484800306d2af3cd454cb6c284d86a9642273382dcca2965e752489543f1e9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0e484800306d2af3cd454cb6c284d86a9642273382dcca2965e752489543f1e9","first_computed_at":"2026-07-05T09:50:18.716396Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T09:50:18.716396Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"/qawZhcdOa4rBvwDh1cYvQgz2j1fr/3onlFMi3frZngmNZy4tEhhU7JmhUBek48Ikg3YA4EsmzU7BcQWTjSGCA==","signature_status":"signed_v1","signed_at":"2026-07-05T09:50:18.716865Z","signed_message":"canonical_sha256_bytes"},"source_id":"2412.12659","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:987ff5d515f63465bd20f24bcb69b380c09f8a7248ab440e9d9c9df2f1e29973","sha256:13310be7b627ef7d3f1e19776483e9caae1bf2db282019f41ca85fe2f8ff9658"],"state_sha256":"377a146f4285121c1586f4b92ee8d151d373e8b341ec79c8122f2fed7e7337c2"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pI3P2sozEbnHS2AuBMMdIAvYWq+/pKh1sI9Pz3+w5EQaqkjvx3L367bg7nbsgEKgz+hqm1p5pdxl2BMDAxfgAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-05T21:33:49.538640Z","bundle_sha256":"f824971b5fd23999e3b52d1a93e00bbb6083caf340814a50f2a9cf113777871c"}}