{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:NNPRUWKHR2RLXDQIR4Y3QGLOPU","short_pith_number":"pith:NNPRUWKH","canonical_record":{"source":{"id":"2406.16101","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2024-06-23T13:20:45Z","cross_cats_sorted":[],"title_canon_sha256":"2374681e14d04ee8ec4a13594c301e2722e1991ff7700436beeaea88e9a9092e","abstract_canon_sha256":"ef67d5bbff9b96904de897c30c5ed45cbe667238ed1bddd86abd54acf341b780"},"schema_version":"1.0"},"canonical_sha256":"6b5f1a59478ea2bb8e088f31b8196e7d1751364b30518e55d3fff389bb506fe6","source":{"kind":"arxiv","id":"2406.16101","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2406.16101","created_at":"2026-07-05T08:37:21Z"},{"alias_kind":"arxiv_version","alias_value":"2406.16101v2","created_at":"2026-07-05T08:37:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2406.16101","created_at":"2026-07-05T08:37:21Z"},{"alias_kind":"pith_short_12","alias_value":"NNPRUWKHR2RL","created_at":"2026-07-05T08:37:21Z"},{"alias_kind":"pith_short_16","alias_value":"NNPRUWKHR2RLXDQI","created_at":"2026-07-05T08:37:21Z"},{"alias_kind":"pith_short_8","alias_value":"NNPRUWKH","created_at":"2026-07-05T08:37:21Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:NNPRUWKHR2RLXDQIR4Y3QGLOPU","target":"record","payload":{"canonical_record":{"source":{"id":"2406.16101","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2024-06-23T13:20:45Z","cross_cats_sorted":[],"title_canon_sha256":"2374681e14d04ee8ec4a13594c301e2722e1991ff7700436beeaea88e9a9092e","abstract_canon_sha256":"ef67d5bbff9b96904de897c30c5ed45cbe667238ed1bddd86abd54acf341b780"},"schema_version":"1.0"},"canonical_sha256":"6b5f1a59478ea2bb8e088f31b8196e7d1751364b30518e55d3fff389bb506fe6","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:37:21.088606Z","signature_b64":"3KaVzzsn53iolBiyPuWDLIepRDS8Sdm4QBPdk1EHQpjZMu9B93brGIWALBG58ZztcQ4UuOPOFP1oINOotzQVDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6b5f1a59478ea2bb8e088f31b8196e7d1751364b30518e55d3fff389bb506fe6","last_reissued_at":"2026-07-05T08:37:21.088168Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:37:21.088168Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2406.16101","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-07-05T08:37:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"H49VvRpOBQZfrnrdExaLfT2B+VfW4QnvrmUVjDYfkTMxyjaHkuOVrvE2ouIYg5Du6OVrSZhOFAls1iequpL6BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-19T09:14:34.531173Z"},"content_sha256":"9209ffd9d7b2f33bd907de10b96090d1f34cda02aaae6495857fcb1116483150","schema_version":"1.0","event_id":"sha256:9209ffd9d7b2f33bd907de10b96090d1f34cda02aaae6495857fcb1116483150"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:NNPRUWKHR2RLXDQIR4Y3QGLOPU","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Extremal digraphs containing at most $t$ paths of length 2 with the same endpoints","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Zejun Huang, Zhenhua Lyu","submitted_at":"2024-06-23T13:20:45Z","abstract_excerpt":"Given a positive integer $t$, let $P_{t,2}$ be the digraph consisting of $t$ directed paths of length 2 with the same initial and terminal vertices. In this paper, we study the maximum size of $P_{t+1,2}$-free digraphs of order $n$, which is denoted by $ex(n, P_{t+1,2})$. For sufficiently large $n$, we prove that $ex(n, P_{t+1})=g(n,t)$ when $\\lfloor(n-t)/{2} \\rfloor$ is odd and $ex(n, P_{t+1,2})\\in \\{g(n,t)-1, g(n,t)\\}$ when $\\lfloor(n-t)/{2} \\rfloor$ is even, where $g(n,t)=\\left\\lceil(n+t)/{2}\\right\\rceil \\left\\lfloor(n-t)/{2}\\right\\rfloor+tn+1$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2406.16101","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2406.16101/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-05T08:37:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Ox31Wi3wNMUb3NxYZB+fj53o48NMMTdtKCh3e8XfiVHxb0dc2PTdQhHIsDoAhGZqA+SbK2BfLjTMCad9rejOBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-19T09:14:34.531707Z"},"content_sha256":"19994d6f3a0eec2ea0636649d611137bb71b24c8f2828ac9dc15227d568e7f90","schema_version":"1.0","event_id":"sha256:19994d6f3a0eec2ea0636649d611137bb71b24c8f2828ac9dc15227d568e7f90"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NNPRUWKHR2RLXDQIR4Y3QGLOPU/bundle.json","state_url":"https://pith.science/pith/NNPRUWKHR2RLXDQIR4Y3QGLOPU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NNPRUWKHR2RLXDQIR4Y3QGLOPU/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-19T09:14:34Z","links":{"resolver":"https://pith.science/pith/NNPRUWKHR2RLXDQIR4Y3QGLOPU","bundle":"https://pith.science/pith/NNPRUWKHR2RLXDQIR4Y3QGLOPU/bundle.json","state":"https://pith.science/pith/NNPRUWKHR2RLXDQIR4Y3QGLOPU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NNPRUWKHR2RLXDQIR4Y3QGLOPU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:NNPRUWKHR2RLXDQIR4Y3QGLOPU","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":"ef67d5bbff9b96904de897c30c5ed45cbe667238ed1bddd86abd54acf341b780","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2024-06-23T13:20:45Z","title_canon_sha256":"2374681e14d04ee8ec4a13594c301e2722e1991ff7700436beeaea88e9a9092e"},"schema_version":"1.0","source":{"id":"2406.16101","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2406.16101","created_at":"2026-07-05T08:37:21Z"},{"alias_kind":"arxiv_version","alias_value":"2406.16101v2","created_at":"2026-07-05T08:37:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2406.16101","created_at":"2026-07-05T08:37:21Z"},{"alias_kind":"pith_short_12","alias_value":"NNPRUWKHR2RL","created_at":"2026-07-05T08:37:21Z"},{"alias_kind":"pith_short_16","alias_value":"NNPRUWKHR2RLXDQI","created_at":"2026-07-05T08:37:21Z"},{"alias_kind":"pith_short_8","alias_value":"NNPRUWKH","created_at":"2026-07-05T08:37:21Z"}],"graph_snapshots":[{"event_id":"sha256:19994d6f3a0eec2ea0636649d611137bb71b24c8f2828ac9dc15227d568e7f90","target":"graph","created_at":"2026-07-05T08:37:21Z","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/2406.16101/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Given a positive integer $t$, let $P_{t,2}$ be the digraph consisting of $t$ directed paths of length 2 with the same initial and terminal vertices. In this paper, we study the maximum size of $P_{t+1,2}$-free digraphs of order $n$, which is denoted by $ex(n, P_{t+1,2})$. For sufficiently large $n$, we prove that $ex(n, P_{t+1})=g(n,t)$ when $\\lfloor(n-t)/{2} \\rfloor$ is odd and $ex(n, P_{t+1,2})\\in \\{g(n,t)-1, g(n,t)\\}$ when $\\lfloor(n-t)/{2} \\rfloor$ is even, where $g(n,t)=\\left\\lceil(n+t)/{2}\\right\\rceil \\left\\lfloor(n-t)/{2}\\right\\rfloor+tn+1$.","authors_text":"Zejun Huang, Zhenhua Lyu","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2024-06-23T13:20:45Z","title":"Extremal digraphs containing at most $t$ paths of length 2 with the same endpoints"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2406.16101","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:9209ffd9d7b2f33bd907de10b96090d1f34cda02aaae6495857fcb1116483150","target":"record","created_at":"2026-07-05T08:37:21Z","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":"ef67d5bbff9b96904de897c30c5ed45cbe667238ed1bddd86abd54acf341b780","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2024-06-23T13:20:45Z","title_canon_sha256":"2374681e14d04ee8ec4a13594c301e2722e1991ff7700436beeaea88e9a9092e"},"schema_version":"1.0","source":{"id":"2406.16101","kind":"arxiv","version":2}},"canonical_sha256":"6b5f1a59478ea2bb8e088f31b8196e7d1751364b30518e55d3fff389bb506fe6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6b5f1a59478ea2bb8e088f31b8196e7d1751364b30518e55d3fff389bb506fe6","first_computed_at":"2026-07-05T08:37:21.088168Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T08:37:21.088168Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"3KaVzzsn53iolBiyPuWDLIepRDS8Sdm4QBPdk1EHQpjZMu9B93brGIWALBG58ZztcQ4UuOPOFP1oINOotzQVDg==","signature_status":"signed_v1","signed_at":"2026-07-05T08:37:21.088606Z","signed_message":"canonical_sha256_bytes"},"source_id":"2406.16101","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9209ffd9d7b2f33bd907de10b96090d1f34cda02aaae6495857fcb1116483150","sha256:19994d6f3a0eec2ea0636649d611137bb71b24c8f2828ac9dc15227d568e7f90"],"state_sha256":"42cbca4e49d453f049f89bd15e68d73830c68842ef5c48475dacbe091a30a1b4"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gwCfSjP+zhnJIST8L/zD0oQ9eJ3o6mxgXJoksnMlrIh9/SdlwUqv/EiQDtJ+r3SmV+JZzJA7O9PiqZr+2hqNBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-19T09:14:34.535650Z","bundle_sha256":"35c2d13c00ed8070242fd49940b8a4187b5cd5a8df213fa381239f2442446665"}}