{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:P76PJCZYH23NFKXZ7GE7INQD3O","short_pith_number":"pith:P76PJCZY","canonical_record":{"source":{"id":"2605.30821","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-05-29T04:12:48Z","cross_cats_sorted":[],"title_canon_sha256":"cc6dd97258339d5e0dad9cb8238ad4bb71c32e74c804b3e1f43d92bd9e4b0fb5","abstract_canon_sha256":"241e05a57e5e1f80d9c173ccfcab585c5263fda0943181141afd3843bea44078"},"schema_version":"1.0"},"canonical_sha256":"7ffcf48b383eb6d2aaf9f989f43603dbbf3b1686931ad63348791b8d2a28754b","source":{"kind":"arxiv","id":"2605.30821","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.30821","created_at":"2026-06-01T01:03:18Z"},{"alias_kind":"arxiv_version","alias_value":"2605.30821v1","created_at":"2026-06-01T01:03:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.30821","created_at":"2026-06-01T01:03:18Z"},{"alias_kind":"pith_short_12","alias_value":"P76PJCZYH23N","created_at":"2026-06-01T01:03:18Z"},{"alias_kind":"pith_short_16","alias_value":"P76PJCZYH23NFKXZ","created_at":"2026-06-01T01:03:18Z"},{"alias_kind":"pith_short_8","alias_value":"P76PJCZY","created_at":"2026-06-01T01:03:18Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:P76PJCZYH23NFKXZ7GE7INQD3O","target":"record","payload":{"canonical_record":{"source":{"id":"2605.30821","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-05-29T04:12:48Z","cross_cats_sorted":[],"title_canon_sha256":"cc6dd97258339d5e0dad9cb8238ad4bb71c32e74c804b3e1f43d92bd9e4b0fb5","abstract_canon_sha256":"241e05a57e5e1f80d9c173ccfcab585c5263fda0943181141afd3843bea44078"},"schema_version":"1.0"},"canonical_sha256":"7ffcf48b383eb6d2aaf9f989f43603dbbf3b1686931ad63348791b8d2a28754b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-01T01:03:18.952395Z","signature_b64":"BFvJZpxBwf98Ql7U9lsqM/A+NvjtbaCTG66b4SRiC85zOu1ZbsuQzith186ArN2hgxr28HigEaLCJUVDs7CtBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7ffcf48b383eb6d2aaf9f989f43603dbbf3b1686931ad63348791b8d2a28754b","last_reissued_at":"2026-06-01T01:03:18.951451Z","signature_status":"signed_v1","first_computed_at":"2026-06-01T01:03:18.951451Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2605.30821","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-06-01T01:03:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NBE3gKEuij09EKVqyNYQXpAo1ABfxZHNGnohlkTrakhvF/HWvmsqDz1LPaIqhFc9uwb/ma3Cp90prM7pa4ytBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-01T07:53:20.942267Z"},"content_sha256":"f5fe6ba63d043e6a169eda4eee010ea8906eb6358b139633042f36d3e15a388e","schema_version":"1.0","event_id":"sha256:f5fe6ba63d043e6a169eda4eee010ea8906eb6358b139633042f36d3e15a388e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:P76PJCZYH23NFKXZ7GE7INQD3O","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The spectral inducibility of graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Liying Kang, Xizhi Liu, Yongchun Lu","submitted_at":"2026-05-29T04:12:48Z","abstract_excerpt":"We introduce a spectral version of the classical inducibility problem. Given an $\\ell$-vertex graph $F$ and an $n$-vertex graph $G$, let $H_F(G)$ be the $\\ell$-uniform hypergraph whose edges are the $\\ell$-sets inducing a copy of $F$ in $G$. We study the maximum possible $\\alpha$-spectral radius of $H_F(G)$ over all $n$-vertex graphs $G$. For fixed $G$, this spectral parameter tends to $\\ell!$ times the number of induced copies of $F$ in $G$ as $\\alpha\\to\\infty$, and therefore refines the usual induced-copy count.\n  Our main result is a spectral analogue of the Brown--Sidorenko reduction: for "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.30821","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/2605.30821/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-06-01T01:03:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hifPAKRuagEx7OncH8OIDUKgjST0nQMs8fbniQDrsOnsrsoj7N7x7x/4D/1FfOpBQcpHFhOKGwdr3uRUAd8dCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-01T07:53:20.942667Z"},"content_sha256":"40e6ea2f08b8eee7ddf2c7d042b81793a2c5933a36441dccf6fd9a480719c217","schema_version":"1.0","event_id":"sha256:40e6ea2f08b8eee7ddf2c7d042b81793a2c5933a36441dccf6fd9a480719c217"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/P76PJCZYH23NFKXZ7GE7INQD3O/bundle.json","state_url":"https://pith.science/pith/P76PJCZYH23NFKXZ7GE7INQD3O/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/P76PJCZYH23NFKXZ7GE7INQD3O/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-01T07:53:20Z","links":{"resolver":"https://pith.science/pith/P76PJCZYH23NFKXZ7GE7INQD3O","bundle":"https://pith.science/pith/P76PJCZYH23NFKXZ7GE7INQD3O/bundle.json","state":"https://pith.science/pith/P76PJCZYH23NFKXZ7GE7INQD3O/state.json","well_known_bundle":"https://pith.science/.well-known/pith/P76PJCZYH23NFKXZ7GE7INQD3O/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:P76PJCZYH23NFKXZ7GE7INQD3O","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":"241e05a57e5e1f80d9c173ccfcab585c5263fda0943181141afd3843bea44078","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-05-29T04:12:48Z","title_canon_sha256":"cc6dd97258339d5e0dad9cb8238ad4bb71c32e74c804b3e1f43d92bd9e4b0fb5"},"schema_version":"1.0","source":{"id":"2605.30821","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.30821","created_at":"2026-06-01T01:03:18Z"},{"alias_kind":"arxiv_version","alias_value":"2605.30821v1","created_at":"2026-06-01T01:03:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.30821","created_at":"2026-06-01T01:03:18Z"},{"alias_kind":"pith_short_12","alias_value":"P76PJCZYH23N","created_at":"2026-06-01T01:03:18Z"},{"alias_kind":"pith_short_16","alias_value":"P76PJCZYH23NFKXZ","created_at":"2026-06-01T01:03:18Z"},{"alias_kind":"pith_short_8","alias_value":"P76PJCZY","created_at":"2026-06-01T01:03:18Z"}],"graph_snapshots":[{"event_id":"sha256:40e6ea2f08b8eee7ddf2c7d042b81793a2c5933a36441dccf6fd9a480719c217","target":"graph","created_at":"2026-06-01T01:03: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/2605.30821/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We introduce a spectral version of the classical inducibility problem. Given an $\\ell$-vertex graph $F$ and an $n$-vertex graph $G$, let $H_F(G)$ be the $\\ell$-uniform hypergraph whose edges are the $\\ell$-sets inducing a copy of $F$ in $G$. We study the maximum possible $\\alpha$-spectral radius of $H_F(G)$ over all $n$-vertex graphs $G$. For fixed $G$, this spectral parameter tends to $\\ell!$ times the number of induced copies of $F$ in $G$ as $\\alpha\\to\\infty$, and therefore refines the usual induced-copy count.\n  Our main result is a spectral analogue of the Brown--Sidorenko reduction: for ","authors_text":"Liying Kang, Xizhi Liu, Yongchun Lu","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-05-29T04:12:48Z","title":"The spectral inducibility of graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.30821","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:f5fe6ba63d043e6a169eda4eee010ea8906eb6358b139633042f36d3e15a388e","target":"record","created_at":"2026-06-01T01:03: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":"241e05a57e5e1f80d9c173ccfcab585c5263fda0943181141afd3843bea44078","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-05-29T04:12:48Z","title_canon_sha256":"cc6dd97258339d5e0dad9cb8238ad4bb71c32e74c804b3e1f43d92bd9e4b0fb5"},"schema_version":"1.0","source":{"id":"2605.30821","kind":"arxiv","version":1}},"canonical_sha256":"7ffcf48b383eb6d2aaf9f989f43603dbbf3b1686931ad63348791b8d2a28754b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7ffcf48b383eb6d2aaf9f989f43603dbbf3b1686931ad63348791b8d2a28754b","first_computed_at":"2026-06-01T01:03:18.951451Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-01T01:03:18.951451Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"BFvJZpxBwf98Ql7U9lsqM/A+NvjtbaCTG66b4SRiC85zOu1ZbsuQzith186ArN2hgxr28HigEaLCJUVDs7CtBQ==","signature_status":"signed_v1","signed_at":"2026-06-01T01:03:18.952395Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.30821","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f5fe6ba63d043e6a169eda4eee010ea8906eb6358b139633042f36d3e15a388e","sha256:40e6ea2f08b8eee7ddf2c7d042b81793a2c5933a36441dccf6fd9a480719c217"],"state_sha256":"b15fc18a3026fd14ab0d015e0f3745d4575071dd2ffc8385d7b51ec7c171b61b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FY+Xxh4syYYCTSSSmXhyphyP/Mir+OamMHlCJ9uef1ydYkuJV4HwP4zUq4SbLcbkff0kYinkfR1y1BEsHlSnDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-01T07:53:20.944863Z","bundle_sha256":"0ea95a431d8c9b82cd993cce8be642a95c3542e2a0d6caaa184f7f3294f418af"}}