{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:BYJDAGOJNWNRG3TQQRGZC62NJC","short_pith_number":"pith:BYJDAGOJ","canonical_record":{"source":{"id":"1812.09089","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-12-21T12:48:01Z","cross_cats_sorted":[],"title_canon_sha256":"f559c43efd0b295839aa8b20838b918c5d05fd44898850e9a817b846c1230e19","abstract_canon_sha256":"c88562c14c68b5a26107072a573b2b247f2e3521f6a4a945994b48fbdb454223"},"schema_version":"1.0"},"canonical_sha256":"0e123019c96d9b136e70844d917b4d4899bf2afd4a9792e34be180e719acc1b4","source":{"kind":"arxiv","id":"1812.09089","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1812.09089","created_at":"2026-05-17T23:57:30Z"},{"alias_kind":"arxiv_version","alias_value":"1812.09089v2","created_at":"2026-05-17T23:57:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1812.09089","created_at":"2026-05-17T23:57:30Z"},{"alias_kind":"pith_short_12","alias_value":"BYJDAGOJNWNR","created_at":"2026-05-18T12:32:16Z"},{"alias_kind":"pith_short_16","alias_value":"BYJDAGOJNWNRG3TQ","created_at":"2026-05-18T12:32:16Z"},{"alias_kind":"pith_short_8","alias_value":"BYJDAGOJ","created_at":"2026-05-18T12:32:16Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:BYJDAGOJNWNRG3TQQRGZC62NJC","target":"record","payload":{"canonical_record":{"source":{"id":"1812.09089","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-12-21T12:48:01Z","cross_cats_sorted":[],"title_canon_sha256":"f559c43efd0b295839aa8b20838b918c5d05fd44898850e9a817b846c1230e19","abstract_canon_sha256":"c88562c14c68b5a26107072a573b2b247f2e3521f6a4a945994b48fbdb454223"},"schema_version":"1.0"},"canonical_sha256":"0e123019c96d9b136e70844d917b4d4899bf2afd4a9792e34be180e719acc1b4","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:57:30.397117Z","signature_b64":"4Oh+/l/4eLKA1CahURScw7zsy0YiFs5C4HuAzyXY1+TYVQGqPMJ4BerCX/Fe2k1DvkD18udK4S6UgkEb9EW1Bw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0e123019c96d9b136e70844d917b4d4899bf2afd4a9792e34be180e719acc1b4","last_reissued_at":"2026-05-17T23:57:30.396594Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:57:30.396594Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1812.09089","source_version":2,"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-05-17T23:57:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/jv7bM3DKDOX65wf3OelINLwnv/ERvhrLEvGgH2n/jm2SvDsQD1O9JdfRQJtCXsyWZ46ULJBZcFBI07HQQcSCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T16:40:21.079451Z"},"content_sha256":"3bb024426b7b29d84f3d2c0d38766eba48bea5ca0a6b87679b6617523da1d783","schema_version":"1.0","event_id":"sha256:3bb024426b7b29d84f3d2c0d38766eba48bea5ca0a6b87679b6617523da1d783"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:BYJDAGOJNWNRG3TQQRGZC62NJC","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The maximum number of triangles in graphs without large linear forests","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Jian Wang, Weihua Yang, Xiuzhuan Duan","submitted_at":"2018-12-21T12:48:01Z","abstract_excerpt":"Let $G$ be a graph on $n$ vertices. A linear forest is a graph consisting of vertex-disjoint paths and isolated vertices. A maximum linear forest of $G$ is a subgraph of $G$ with maximum number of edges, which is a linear forest. We denote by $l(G)$ this maximum number. Let $t=\\left\\lfloor (k-1)/2\\right \\rfloor$. Recently, Ning and Wang \\cite{boning} proved that if $l(G)=k-1$, then for any $k<n$ \\[ e(G) \\leq \\max \\left\\{\\binom{k}{2},\\binom{t}{2}+t (n - t)+ c \\right\\}, \\] where $c=0$ if $k$ is odd and $c=1$ otherwise, and the inequality is tight. In this paper, we prove that if $l(G)=k-1$ and $"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1812.09089","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"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-05-17T23:57:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0lcFiAzB7aQMgGZvkLP0RvCVNqFd6faMJsz/Wd8CPXwl7Q8X1i+s/R7VUrJoYsupK2wvPSvqJAmpUz1MWupyAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T16:40:21.080163Z"},"content_sha256":"27c904dac42d30368981fcc5322b3397300a0782e3a247b805c4ea9347e9e7af","schema_version":"1.0","event_id":"sha256:27c904dac42d30368981fcc5322b3397300a0782e3a247b805c4ea9347e9e7af"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BYJDAGOJNWNRG3TQQRGZC62NJC/bundle.json","state_url":"https://pith.science/pith/BYJDAGOJNWNRG3TQQRGZC62NJC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BYJDAGOJNWNRG3TQQRGZC62NJC/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-05-25T16:40:21Z","links":{"resolver":"https://pith.science/pith/BYJDAGOJNWNRG3TQQRGZC62NJC","bundle":"https://pith.science/pith/BYJDAGOJNWNRG3TQQRGZC62NJC/bundle.json","state":"https://pith.science/pith/BYJDAGOJNWNRG3TQQRGZC62NJC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BYJDAGOJNWNRG3TQQRGZC62NJC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:BYJDAGOJNWNRG3TQQRGZC62NJC","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":"c88562c14c68b5a26107072a573b2b247f2e3521f6a4a945994b48fbdb454223","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-12-21T12:48:01Z","title_canon_sha256":"f559c43efd0b295839aa8b20838b918c5d05fd44898850e9a817b846c1230e19"},"schema_version":"1.0","source":{"id":"1812.09089","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1812.09089","created_at":"2026-05-17T23:57:30Z"},{"alias_kind":"arxiv_version","alias_value":"1812.09089v2","created_at":"2026-05-17T23:57:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1812.09089","created_at":"2026-05-17T23:57:30Z"},{"alias_kind":"pith_short_12","alias_value":"BYJDAGOJNWNR","created_at":"2026-05-18T12:32:16Z"},{"alias_kind":"pith_short_16","alias_value":"BYJDAGOJNWNRG3TQ","created_at":"2026-05-18T12:32:16Z"},{"alias_kind":"pith_short_8","alias_value":"BYJDAGOJ","created_at":"2026-05-18T12:32:16Z"}],"graph_snapshots":[{"event_id":"sha256:27c904dac42d30368981fcc5322b3397300a0782e3a247b805c4ea9347e9e7af","target":"graph","created_at":"2026-05-17T23:57:30Z","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"},"paper":{"abstract_excerpt":"Let $G$ be a graph on $n$ vertices. A linear forest is a graph consisting of vertex-disjoint paths and isolated vertices. A maximum linear forest of $G$ is a subgraph of $G$ with maximum number of edges, which is a linear forest. We denote by $l(G)$ this maximum number. Let $t=\\left\\lfloor (k-1)/2\\right \\rfloor$. Recently, Ning and Wang \\cite{boning} proved that if $l(G)=k-1$, then for any $k<n$ \\[ e(G) \\leq \\max \\left\\{\\binom{k}{2},\\binom{t}{2}+t (n - t)+ c \\right\\}, \\] where $c=0$ if $k$ is odd and $c=1$ otherwise, and the inequality is tight. In this paper, we prove that if $l(G)=k-1$ and $","authors_text":"Jian Wang, Weihua Yang, Xiuzhuan Duan","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-12-21T12:48:01Z","title":"The maximum number of triangles in graphs without large linear forests"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1812.09089","kind":"arxiv","version":2},"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:3bb024426b7b29d84f3d2c0d38766eba48bea5ca0a6b87679b6617523da1d783","target":"record","created_at":"2026-05-17T23:57:30Z","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":"c88562c14c68b5a26107072a573b2b247f2e3521f6a4a945994b48fbdb454223","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-12-21T12:48:01Z","title_canon_sha256":"f559c43efd0b295839aa8b20838b918c5d05fd44898850e9a817b846c1230e19"},"schema_version":"1.0","source":{"id":"1812.09089","kind":"arxiv","version":2}},"canonical_sha256":"0e123019c96d9b136e70844d917b4d4899bf2afd4a9792e34be180e719acc1b4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0e123019c96d9b136e70844d917b4d4899bf2afd4a9792e34be180e719acc1b4","first_computed_at":"2026-05-17T23:57:30.396594Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:57:30.396594Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"4Oh+/l/4eLKA1CahURScw7zsy0YiFs5C4HuAzyXY1+TYVQGqPMJ4BerCX/Fe2k1DvkD18udK4S6UgkEb9EW1Bw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:57:30.397117Z","signed_message":"canonical_sha256_bytes"},"source_id":"1812.09089","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3bb024426b7b29d84f3d2c0d38766eba48bea5ca0a6b87679b6617523da1d783","sha256:27c904dac42d30368981fcc5322b3397300a0782e3a247b805c4ea9347e9e7af"],"state_sha256":"5699cf5567ad5bcd4226516e73a10e7e68ee1d75e3e4634bd41b2528a4a8ab71"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"piQg3KzXcJh34S6BXB4P0qCau7gK78+rLNTFabL+5nY+hSRL0Lx7OayCCXMzK3leKbOFnFNxEFRYjFcPRVQ+AA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T16:40:21.083823Z","bundle_sha256":"6eb41f7142478de4e29352f6a0cddeac291e4f306912b8ba876246c20207a985"}}