{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:CW5LVPLZAUZDHOVHQXPD2Y637K","short_pith_number":"pith:CW5LVPLZ","canonical_record":{"source":{"id":"2607.15071","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-07-16T14:43:37Z","cross_cats_sorted":[],"title_canon_sha256":"37ff9667e83f3dd065b848ae0cf0b431d298af7d7addc1afda57031878f32ecf","abstract_canon_sha256":"44e549f1d793f945340553d75e928677ab80eea6d2505090468bdc05d25aa4ff"},"schema_version":"1.0"},"canonical_sha256":"15bababd79053233baa785de3d63dbfabd874a789ae3b79057b8cac7063c394a","source":{"kind":"arxiv","id":"2607.15071","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2607.15071","created_at":"2026-07-17T01:22:07Z"},{"alias_kind":"arxiv_version","alias_value":"2607.15071v1","created_at":"2026-07-17T01:22:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.15071","created_at":"2026-07-17T01:22:07Z"},{"alias_kind":"pith_short_12","alias_value":"CW5LVPLZAUZD","created_at":"2026-07-17T01:22:07Z"},{"alias_kind":"pith_short_16","alias_value":"CW5LVPLZAUZDHOVH","created_at":"2026-07-17T01:22:07Z"},{"alias_kind":"pith_short_8","alias_value":"CW5LVPLZ","created_at":"2026-07-17T01:22:07Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:CW5LVPLZAUZDHOVHQXPD2Y637K","target":"record","payload":{"canonical_record":{"source":{"id":"2607.15071","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-07-16T14:43:37Z","cross_cats_sorted":[],"title_canon_sha256":"37ff9667e83f3dd065b848ae0cf0b431d298af7d7addc1afda57031878f32ecf","abstract_canon_sha256":"44e549f1d793f945340553d75e928677ab80eea6d2505090468bdc05d25aa4ff"},"schema_version":"1.0"},"canonical_sha256":"15bababd79053233baa785de3d63dbfabd874a789ae3b79057b8cac7063c394a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-17T01:22:07.983910Z","signature_b64":"4dvomxXQqGOfwu99dXETRPf5uk4ahSiC7mKysWwMYLiY6Y2ajDqvPZY+gLL6vMIfr+eolxJjQAzxe2FiJOIoAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"15bababd79053233baa785de3d63dbfabd874a789ae3b79057b8cac7063c394a","last_reissued_at":"2026-07-17T01:22:07.983088Z","signature_status":"signed_v1","first_computed_at":"2026-07-17T01:22:07.983088Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2607.15071","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-17T01:22:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FDOjCWXefk7cuaNZia+IYeWiSgL5ExkPtipBUdkixYFQbOqFSET86rqbaevFPUelTNgbdyLUqVNHJGkEZei7CA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-09T23:58:33.528337Z"},"content_sha256":"0c14b70c5a84d1872e026d659188acbed140f8850e2991342e246b67a7a88c21","schema_version":"1.0","event_id":"sha256:0c14b70c5a84d1872e026d659188acbed140f8850e2991342e246b67a7a88c21"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:CW5LVPLZAUZDHOVHQXPD2Y637K","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Two problems on booksize and triangular edges in Nosal graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Jing Zeng, Lihua You, Xiaoxue Zhang, Xinghui Zhao","submitted_at":"2026-07-16T14:43:37Z","abstract_excerpt":"A graph $G$ with $m$ edges is said to be a Nosal graph if $\\rho(G)>\\sqrt{m}$. For a graph $G$, we write $bk(G)$ for its maximum book size and $\\tau(G)$ for the number of edges contained in triangles. Li, Liu and Zhang [J. Combin. Theory Ser. B 179 (2026) 219--249] proved that every $m$-edge Nosal graph satisfies $bk(G)> \\frac{1}{24}\\sqrt{m}$ and $\\tau(G) > \\frac{1}{12}\\sqrt{m}$. Recently, Zhai, Li and Lou [arXiv:2601.10163v2] proved that every $m$-edge Nosal graph satisfies $bk(G)> \\frac{1}{9}\\sqrt{m}$. In this paper, we establish the following result: Every $m$-edge graph $G$ with no isolated"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.15071","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.15071/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-17T01:22:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Txm77X1qHZox0YDZ9ag3nzGy0ABXrGyHfpFWcwOsbIoxB96RS3k/cOtlR8TUnX6SPD2yvE3Pbz4un1GSUzBpCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-09T23:58:33.529173Z"},"content_sha256":"b2936690035c563508f05920bf41b3c15b8ccb04e827e10e129f39cf61f95774","schema_version":"1.0","event_id":"sha256:b2936690035c563508f05920bf41b3c15b8ccb04e827e10e129f39cf61f95774"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CW5LVPLZAUZDHOVHQXPD2Y637K/bundle.json","state_url":"https://pith.science/pith/CW5LVPLZAUZDHOVHQXPD2Y637K/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CW5LVPLZAUZDHOVHQXPD2Y637K/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-09T23:58:33Z","links":{"resolver":"https://pith.science/pith/CW5LVPLZAUZDHOVHQXPD2Y637K","bundle":"https://pith.science/pith/CW5LVPLZAUZDHOVHQXPD2Y637K/bundle.json","state":"https://pith.science/pith/CW5LVPLZAUZDHOVHQXPD2Y637K/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CW5LVPLZAUZDHOVHQXPD2Y637K/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:CW5LVPLZAUZDHOVHQXPD2Y637K","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":"44e549f1d793f945340553d75e928677ab80eea6d2505090468bdc05d25aa4ff","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-07-16T14:43:37Z","title_canon_sha256":"37ff9667e83f3dd065b848ae0cf0b431d298af7d7addc1afda57031878f32ecf"},"schema_version":"1.0","source":{"id":"2607.15071","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2607.15071","created_at":"2026-07-17T01:22:07Z"},{"alias_kind":"arxiv_version","alias_value":"2607.15071v1","created_at":"2026-07-17T01:22:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.15071","created_at":"2026-07-17T01:22:07Z"},{"alias_kind":"pith_short_12","alias_value":"CW5LVPLZAUZD","created_at":"2026-07-17T01:22:07Z"},{"alias_kind":"pith_short_16","alias_value":"CW5LVPLZAUZDHOVH","created_at":"2026-07-17T01:22:07Z"},{"alias_kind":"pith_short_8","alias_value":"CW5LVPLZ","created_at":"2026-07-17T01:22:07Z"}],"graph_snapshots":[{"event_id":"sha256:b2936690035c563508f05920bf41b3c15b8ccb04e827e10e129f39cf61f95774","target":"graph","created_at":"2026-07-17T01:22:07Z","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.15071/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"A graph $G$ with $m$ edges is said to be a Nosal graph if $\\rho(G)>\\sqrt{m}$. For a graph $G$, we write $bk(G)$ for its maximum book size and $\\tau(G)$ for the number of edges contained in triangles. Li, Liu and Zhang [J. Combin. Theory Ser. B 179 (2026) 219--249] proved that every $m$-edge Nosal graph satisfies $bk(G)> \\frac{1}{24}\\sqrt{m}$ and $\\tau(G) > \\frac{1}{12}\\sqrt{m}$. Recently, Zhai, Li and Lou [arXiv:2601.10163v2] proved that every $m$-edge Nosal graph satisfies $bk(G)> \\frac{1}{9}\\sqrt{m}$. In this paper, we establish the following result: Every $m$-edge graph $G$ with no isolated","authors_text":"Jing Zeng, Lihua You, Xiaoxue Zhang, Xinghui Zhao","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-07-16T14:43:37Z","title":"Two problems on booksize and triangular edges in Nosal graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.15071","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:0c14b70c5a84d1872e026d659188acbed140f8850e2991342e246b67a7a88c21","target":"record","created_at":"2026-07-17T01:22:07Z","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":"44e549f1d793f945340553d75e928677ab80eea6d2505090468bdc05d25aa4ff","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-07-16T14:43:37Z","title_canon_sha256":"37ff9667e83f3dd065b848ae0cf0b431d298af7d7addc1afda57031878f32ecf"},"schema_version":"1.0","source":{"id":"2607.15071","kind":"arxiv","version":1}},"canonical_sha256":"15bababd79053233baa785de3d63dbfabd874a789ae3b79057b8cac7063c394a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"15bababd79053233baa785de3d63dbfabd874a789ae3b79057b8cac7063c394a","first_computed_at":"2026-07-17T01:22:07.983088Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-17T01:22:07.983088Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"4dvomxXQqGOfwu99dXETRPf5uk4ahSiC7mKysWwMYLiY6Y2ajDqvPZY+gLL6vMIfr+eolxJjQAzxe2FiJOIoAA==","signature_status":"signed_v1","signed_at":"2026-07-17T01:22:07.983910Z","signed_message":"canonical_sha256_bytes"},"source_id":"2607.15071","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0c14b70c5a84d1872e026d659188acbed140f8850e2991342e246b67a7a88c21","sha256:b2936690035c563508f05920bf41b3c15b8ccb04e827e10e129f39cf61f95774"],"state_sha256":"2430ffb44b383cf99930cbacb128c0d85f2d58e809c4f81bdeec80f426a29ef2"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Bb7ZdgXXDJ6srzu1e1Fo1Z99dqPHOhyc84awEX7LqsKv1s+0lxLc4Ot24k1RY443Nl7/TrJe9U7A89EfCvkLBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-09T23:58:33.536029Z","bundle_sha256":"49d6036f830e5fe815faa574a912708c2cadfbcc402b379bfc5f9ea8e9da898f"}}