{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:KCLQWZYCZK2L2YX6MGQIYUBJPQ","short_pith_number":"pith:KCLQWZYC","canonical_record":{"source":{"id":"2607.08468","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"math.CO","submitted_at":"2026-07-09T13:26:46Z","cross_cats_sorted":[],"title_canon_sha256":"b860326ba52d7956cba2efda9dab87ae95b371f53b50416d4b1fec9cef8c1e5b","abstract_canon_sha256":"f0a3334eb8d526e4d901fa7f50cf652f79d46a976f9790030fd74e4ad1deedcf"},"schema_version":"1.0"},"canonical_sha256":"50970b6702cab4bd62fe61a08c50297c13cb38d0bc25eaaab9b58e495e700a7e","source":{"kind":"arxiv","id":"2607.08468","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2607.08468","created_at":"2026-07-10T01:19:51Z"},{"alias_kind":"arxiv_version","alias_value":"2607.08468v1","created_at":"2026-07-10T01:19:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.08468","created_at":"2026-07-10T01:19:51Z"},{"alias_kind":"pith_short_12","alias_value":"KCLQWZYCZK2L","created_at":"2026-07-10T01:19:51Z"},{"alias_kind":"pith_short_16","alias_value":"KCLQWZYCZK2L2YX6","created_at":"2026-07-10T01:19:51Z"},{"alias_kind":"pith_short_8","alias_value":"KCLQWZYC","created_at":"2026-07-10T01:19:51Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:KCLQWZYCZK2L2YX6MGQIYUBJPQ","target":"record","payload":{"canonical_record":{"source":{"id":"2607.08468","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"math.CO","submitted_at":"2026-07-09T13:26:46Z","cross_cats_sorted":[],"title_canon_sha256":"b860326ba52d7956cba2efda9dab87ae95b371f53b50416d4b1fec9cef8c1e5b","abstract_canon_sha256":"f0a3334eb8d526e4d901fa7f50cf652f79d46a976f9790030fd74e4ad1deedcf"},"schema_version":"1.0"},"canonical_sha256":"50970b6702cab4bd62fe61a08c50297c13cb38d0bc25eaaab9b58e495e700a7e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-10T01:19:51.424231Z","signature_b64":"WRGeS4QwEzO+uNXGLNZgV/gVH0yjWgKQDdfDqAKTnp/1zrz/S+ZpW5FADs+/etUSXsC+bdP2DYXDdTMWlTNhCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"50970b6702cab4bd62fe61a08c50297c13cb38d0bc25eaaab9b58e495e700a7e","last_reissued_at":"2026-07-10T01:19:51.423883Z","signature_status":"signed_v1","first_computed_at":"2026-07-10T01:19:51.423883Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2607.08468","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-10T01:19:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"B0pzUBp2wd/RwuGe9t3zbkwupxNCVkTRb8eQvSTOqdsmkeLMzVwGmFCUNU8SyPQa3Elw/QAU2cjE5/h/qYpoBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-14T00:17:36.504844Z"},"content_sha256":"c6484355bd748b85854bfa15b0923eb6fb0e6bf8e823bd4915330ffb5a5fd273","schema_version":"1.0","event_id":"sha256:c6484355bd748b85854bfa15b0923eb6fb0e6bf8e823bd4915330ffb5a5fd273"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:KCLQWZYCZK2L2YX6MGQIYUBJPQ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Spectral Radius Conditions for 3-Uniform Intersecting Families","license":"http://creativecommons.org/licenses/by-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"An Chang, Guorong Gao, Lusheng Fang","submitted_at":"2026-07-09T13:26:46Z","abstract_excerpt":"Let $M_k$ denote a matching of size $k$. The classical Erd\\H{o}s matching conjecture asks for the maximum number of edges of an intersecting $r$-graph without $M_k$. The csae for $k=2$, which is known as intersecting $r$-graph, is established by Erd\\H{o}s, Ko and Rado. Hilton and Milner further determine the maximum number of edges of a non-trivial intersecting $r$-graph, where the intersecting $r$-graph $H$ is called non-trivial if $\\cap_{e\\in E(H)}e=\\emptyset$. In this paper, we investigate the spectral analogues of the hpergraph matching problems and intersecting family problems. More preci"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.08468","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/2607.08468/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-10T01:19:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SoSf7T/7HrS5Zfwn2GSaYOWNG9tk9Fi9D+yukK8GMaXlJqOb9BzWb3JKnhL73iJ0k2XO1KmrvROAk/i0VRMWAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-14T00:17:36.505514Z"},"content_sha256":"735d44378c3afac85942b18085f1bc9ac2494dfa52f329f565e157c3e54fbcda","schema_version":"1.0","event_id":"sha256:735d44378c3afac85942b18085f1bc9ac2494dfa52f329f565e157c3e54fbcda"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KCLQWZYCZK2L2YX6MGQIYUBJPQ/bundle.json","state_url":"https://pith.science/pith/KCLQWZYCZK2L2YX6MGQIYUBJPQ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KCLQWZYCZK2L2YX6MGQIYUBJPQ/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-14T00:17:36Z","links":{"resolver":"https://pith.science/pith/KCLQWZYCZK2L2YX6MGQIYUBJPQ","bundle":"https://pith.science/pith/KCLQWZYCZK2L2YX6MGQIYUBJPQ/bundle.json","state":"https://pith.science/pith/KCLQWZYCZK2L2YX6MGQIYUBJPQ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KCLQWZYCZK2L2YX6MGQIYUBJPQ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:KCLQWZYCZK2L2YX6MGQIYUBJPQ","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":"f0a3334eb8d526e4d901fa7f50cf652f79d46a976f9790030fd74e4ad1deedcf","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"math.CO","submitted_at":"2026-07-09T13:26:46Z","title_canon_sha256":"b860326ba52d7956cba2efda9dab87ae95b371f53b50416d4b1fec9cef8c1e5b"},"schema_version":"1.0","source":{"id":"2607.08468","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2607.08468","created_at":"2026-07-10T01:19:51Z"},{"alias_kind":"arxiv_version","alias_value":"2607.08468v1","created_at":"2026-07-10T01:19:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.08468","created_at":"2026-07-10T01:19:51Z"},{"alias_kind":"pith_short_12","alias_value":"KCLQWZYCZK2L","created_at":"2026-07-10T01:19:51Z"},{"alias_kind":"pith_short_16","alias_value":"KCLQWZYCZK2L2YX6","created_at":"2026-07-10T01:19:51Z"},{"alias_kind":"pith_short_8","alias_value":"KCLQWZYC","created_at":"2026-07-10T01:19:51Z"}],"graph_snapshots":[{"event_id":"sha256:735d44378c3afac85942b18085f1bc9ac2494dfa52f329f565e157c3e54fbcda","target":"graph","created_at":"2026-07-10T01:19:51Z","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/2607.08468/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Let $M_k$ denote a matching of size $k$. The classical Erd\\H{o}s matching conjecture asks for the maximum number of edges of an intersecting $r$-graph without $M_k$. The csae for $k=2$, which is known as intersecting $r$-graph, is established by Erd\\H{o}s, Ko and Rado. Hilton and Milner further determine the maximum number of edges of a non-trivial intersecting $r$-graph, where the intersecting $r$-graph $H$ is called non-trivial if $\\cap_{e\\in E(H)}e=\\emptyset$. In this paper, we investigate the spectral analogues of the hpergraph matching problems and intersecting family problems. More preci","authors_text":"An Chang, Guorong Gao, Lusheng Fang","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"math.CO","submitted_at":"2026-07-09T13:26:46Z","title":"Spectral Radius Conditions for 3-Uniform Intersecting Families"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.08468","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:c6484355bd748b85854bfa15b0923eb6fb0e6bf8e823bd4915330ffb5a5fd273","target":"record","created_at":"2026-07-10T01:19:51Z","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":"f0a3334eb8d526e4d901fa7f50cf652f79d46a976f9790030fd74e4ad1deedcf","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"math.CO","submitted_at":"2026-07-09T13:26:46Z","title_canon_sha256":"b860326ba52d7956cba2efda9dab87ae95b371f53b50416d4b1fec9cef8c1e5b"},"schema_version":"1.0","source":{"id":"2607.08468","kind":"arxiv","version":1}},"canonical_sha256":"50970b6702cab4bd62fe61a08c50297c13cb38d0bc25eaaab9b58e495e700a7e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"50970b6702cab4bd62fe61a08c50297c13cb38d0bc25eaaab9b58e495e700a7e","first_computed_at":"2026-07-10T01:19:51.423883Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-10T01:19:51.423883Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"WRGeS4QwEzO+uNXGLNZgV/gVH0yjWgKQDdfDqAKTnp/1zrz/S+ZpW5FADs+/etUSXsC+bdP2DYXDdTMWlTNhCQ==","signature_status":"signed_v1","signed_at":"2026-07-10T01:19:51.424231Z","signed_message":"canonical_sha256_bytes"},"source_id":"2607.08468","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c6484355bd748b85854bfa15b0923eb6fb0e6bf8e823bd4915330ffb5a5fd273","sha256:735d44378c3afac85942b18085f1bc9ac2494dfa52f329f565e157c3e54fbcda"],"state_sha256":"006ce5933000a773a85fff3d302ca2b758cb9091d0df35171fd4575b2a93e115"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/kmlaP5XQ+2d1uKiF0pGHf33we9dvWtH/dttLZFGk6G4QWKNAlDlY1Q3/7jZpQENCNMJUAsdD//bGHZpwzYcAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-14T00:17:36.511204Z","bundle_sha256":"3abe61caf236363cb7502269ff34f7c9e6a81cec8835b188224e8924e67d283c"}}