{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:MQY43BL3O4VKUDYKRFR23OZSJE","short_pith_number":"pith:MQY43BL3","canonical_record":{"source":{"id":"2505.12035","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2025-05-17T14:55:02Z","cross_cats_sorted":[],"title_canon_sha256":"cb7029ad350b7de50faad3c82f0ac9c7f4b9a9cab84bc5606576f3cdd6e0245d","abstract_canon_sha256":"b22051c4072262410cac698eaad46c3ad33a96efd6f2cd64de032a9c5b1b390b"},"schema_version":"1.0"},"canonical_sha256":"6431cd857b772aaa0f0a8963adbb32491de67ebdd91ac38f215fe8722cdf798f","source":{"kind":"arxiv","id":"2505.12035","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2505.12035","created_at":"2026-07-05T11:04:57Z"},{"alias_kind":"arxiv_version","alias_value":"2505.12035v1","created_at":"2026-07-05T11:04:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2505.12035","created_at":"2026-07-05T11:04:57Z"},{"alias_kind":"pith_short_12","alias_value":"MQY43BL3O4VK","created_at":"2026-07-05T11:04:57Z"},{"alias_kind":"pith_short_16","alias_value":"MQY43BL3O4VKUDYK","created_at":"2026-07-05T11:04:57Z"},{"alias_kind":"pith_short_8","alias_value":"MQY43BL3","created_at":"2026-07-05T11:04:57Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:MQY43BL3O4VKUDYKRFR23OZSJE","target":"record","payload":{"canonical_record":{"source":{"id":"2505.12035","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2025-05-17T14:55:02Z","cross_cats_sorted":[],"title_canon_sha256":"cb7029ad350b7de50faad3c82f0ac9c7f4b9a9cab84bc5606576f3cdd6e0245d","abstract_canon_sha256":"b22051c4072262410cac698eaad46c3ad33a96efd6f2cd64de032a9c5b1b390b"},"schema_version":"1.0"},"canonical_sha256":"6431cd857b772aaa0f0a8963adbb32491de67ebdd91ac38f215fe8722cdf798f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:04:57.263696Z","signature_b64":"04bCQUtbd3f06/QlajYdu9sXieAeroTbs3a1Cc3I30FFJaCZDhVZF7oZe4V6IH+iF0hTEyIZzkuiH9r8ijk5CA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6431cd857b772aaa0f0a8963adbb32491de67ebdd91ac38f215fe8722cdf798f","last_reissued_at":"2026-07-05T11:04:57.263196Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:04:57.263196Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2505.12035","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-05T11:04:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"36x+GXWDaip49otuhgJYjdd0gGWVpmR/O7kMjcxZWaNJGfIwMllJcSp/qsYFvNHMgqRUavEoc3xwtJ7gJOXVCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-08T05:20:34.234582Z"},"content_sha256":"4c6f2253228ef3e5e0df52a9cf1a93e4f66680dbeb3ca7602ec853614ad92ace","schema_version":"1.0","event_id":"sha256:4c6f2253228ef3e5e0df52a9cf1a93e4f66680dbeb3ca7602ec853614ad92ace"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:MQY43BL3O4VKUDYKRFR23OZSJE","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"An Ore-type theorem for $[3]$-graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Linyuan Lu, Ruth Luo, Yupei Li","submitted_at":"2025-05-17T14:55:02Z","abstract_excerpt":"Ore's Theorem states that if $G$ is an $n$-vertex graph and every pair of non-adjacent vertices has degree sum at least $n$, then $G$ is Hamiltonian.\n  A $[3]$-graph is a hypergraph in which every edge contains at most $3$ vertices. In this paper, we prove an Ore-type result on the existence of Hamiltonian Berge cycles in $[3]$-graph $\\cH$, based on the degree sum of every pair of non-adjacent vertices in the $2$-shadow graph $\\partial \\cH$ of $\\cH$. Namely, we prove that there exists a constant $d_0$ such that for all $n \\geq 6$, if a $[3]$-graph $\\cH$ on $n$ vertices satisfies that every pai"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2505.12035","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/2505.12035/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-05T11:04:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"feXrnZbqHIikFoRHfQh1sWRA7lXlwq9I1EGK59Joxj7uVvtGR5lKHUM8lP5cg+2FDjOPyK6N/oIgMDdL4l6aBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-08T05:20:34.234956Z"},"content_sha256":"09c24e8aa371f4bbdecc7a17f1d968f7512747e838d110761a15af425f3f44fa","schema_version":"1.0","event_id":"sha256:09c24e8aa371f4bbdecc7a17f1d968f7512747e838d110761a15af425f3f44fa"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MQY43BL3O4VKUDYKRFR23OZSJE/bundle.json","state_url":"https://pith.science/pith/MQY43BL3O4VKUDYKRFR23OZSJE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MQY43BL3O4VKUDYKRFR23OZSJE/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-07-08T05:20:34Z","links":{"resolver":"https://pith.science/pith/MQY43BL3O4VKUDYKRFR23OZSJE","bundle":"https://pith.science/pith/MQY43BL3O4VKUDYKRFR23OZSJE/bundle.json","state":"https://pith.science/pith/MQY43BL3O4VKUDYKRFR23OZSJE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MQY43BL3O4VKUDYKRFR23OZSJE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:MQY43BL3O4VKUDYKRFR23OZSJE","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":"b22051c4072262410cac698eaad46c3ad33a96efd6f2cd64de032a9c5b1b390b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2025-05-17T14:55:02Z","title_canon_sha256":"cb7029ad350b7de50faad3c82f0ac9c7f4b9a9cab84bc5606576f3cdd6e0245d"},"schema_version":"1.0","source":{"id":"2505.12035","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2505.12035","created_at":"2026-07-05T11:04:57Z"},{"alias_kind":"arxiv_version","alias_value":"2505.12035v1","created_at":"2026-07-05T11:04:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2505.12035","created_at":"2026-07-05T11:04:57Z"},{"alias_kind":"pith_short_12","alias_value":"MQY43BL3O4VK","created_at":"2026-07-05T11:04:57Z"},{"alias_kind":"pith_short_16","alias_value":"MQY43BL3O4VKUDYK","created_at":"2026-07-05T11:04:57Z"},{"alias_kind":"pith_short_8","alias_value":"MQY43BL3","created_at":"2026-07-05T11:04:57Z"}],"graph_snapshots":[{"event_id":"sha256:09c24e8aa371f4bbdecc7a17f1d968f7512747e838d110761a15af425f3f44fa","target":"graph","created_at":"2026-07-05T11:04:57Z","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/2505.12035/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Ore's Theorem states that if $G$ is an $n$-vertex graph and every pair of non-adjacent vertices has degree sum at least $n$, then $G$ is Hamiltonian.\n  A $[3]$-graph is a hypergraph in which every edge contains at most $3$ vertices. In this paper, we prove an Ore-type result on the existence of Hamiltonian Berge cycles in $[3]$-graph $\\cH$, based on the degree sum of every pair of non-adjacent vertices in the $2$-shadow graph $\\partial \\cH$ of $\\cH$. Namely, we prove that there exists a constant $d_0$ such that for all $n \\geq 6$, if a $[3]$-graph $\\cH$ on $n$ vertices satisfies that every pai","authors_text":"Linyuan Lu, Ruth Luo, Yupei Li","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2025-05-17T14:55:02Z","title":"An Ore-type theorem for $[3]$-graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2505.12035","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:4c6f2253228ef3e5e0df52a9cf1a93e4f66680dbeb3ca7602ec853614ad92ace","target":"record","created_at":"2026-07-05T11:04:57Z","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":"b22051c4072262410cac698eaad46c3ad33a96efd6f2cd64de032a9c5b1b390b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2025-05-17T14:55:02Z","title_canon_sha256":"cb7029ad350b7de50faad3c82f0ac9c7f4b9a9cab84bc5606576f3cdd6e0245d"},"schema_version":"1.0","source":{"id":"2505.12035","kind":"arxiv","version":1}},"canonical_sha256":"6431cd857b772aaa0f0a8963adbb32491de67ebdd91ac38f215fe8722cdf798f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6431cd857b772aaa0f0a8963adbb32491de67ebdd91ac38f215fe8722cdf798f","first_computed_at":"2026-07-05T11:04:57.263196Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:04:57.263196Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"04bCQUtbd3f06/QlajYdu9sXieAeroTbs3a1Cc3I30FFJaCZDhVZF7oZe4V6IH+iF0hTEyIZzkuiH9r8ijk5CA==","signature_status":"signed_v1","signed_at":"2026-07-05T11:04:57.263696Z","signed_message":"canonical_sha256_bytes"},"source_id":"2505.12035","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4c6f2253228ef3e5e0df52a9cf1a93e4f66680dbeb3ca7602ec853614ad92ace","sha256:09c24e8aa371f4bbdecc7a17f1d968f7512747e838d110761a15af425f3f44fa"],"state_sha256":"b63b7ff268a7f81efa0dc8ce13d372dd7d8a5dd9027e3a14a3716196e81ce7c0"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tjEgjGlZI9n3CLwQEoXpUbgbLVT4USm4UtAT+WpaV6uMA5ZUS/AjmvSpIuTUtg4FZMFqQHka/G8y4IZXQQDWBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-08T05:20:34.236947Z","bundle_sha256":"4e41e07de1684b7cf19b08f94355c325ca4082b3047ce4c3b81c3add86e9c883"}}