{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:EQKECOCKVYZYGXFVGK6LDRVFE4","short_pith_number":"pith:EQKECOCK","canonical_record":{"source":{"id":"1601.01211","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-01-06T15:35:35Z","cross_cats_sorted":[],"title_canon_sha256":"2c96b4b6f9dec84dd1745785c38766671fecb6768b2c121d3617c970b7a0ae40","abstract_canon_sha256":"cfe6f3b2e3d1f78aa0bb7388e25d4e30c3109e6e7a7afe0ebe20a77298caa482"},"schema_version":"1.0"},"canonical_sha256":"241441384aae33835cb532bcb1c6a52730212a4743bfd67f30aeddea55f6aabe","source":{"kind":"arxiv","id":"1601.01211","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1601.01211","created_at":"2026-05-18T01:23:17Z"},{"alias_kind":"arxiv_version","alias_value":"1601.01211v1","created_at":"2026-05-18T01:23:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1601.01211","created_at":"2026-05-18T01:23:17Z"},{"alias_kind":"pith_short_12","alias_value":"EQKECOCKVYZY","created_at":"2026-05-18T12:30:12Z"},{"alias_kind":"pith_short_16","alias_value":"EQKECOCKVYZYGXFV","created_at":"2026-05-18T12:30:12Z"},{"alias_kind":"pith_short_8","alias_value":"EQKECOCK","created_at":"2026-05-18T12:30:12Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:EQKECOCKVYZYGXFVGK6LDRVFE4","target":"record","payload":{"canonical_record":{"source":{"id":"1601.01211","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-01-06T15:35:35Z","cross_cats_sorted":[],"title_canon_sha256":"2c96b4b6f9dec84dd1745785c38766671fecb6768b2c121d3617c970b7a0ae40","abstract_canon_sha256":"cfe6f3b2e3d1f78aa0bb7388e25d4e30c3109e6e7a7afe0ebe20a77298caa482"},"schema_version":"1.0"},"canonical_sha256":"241441384aae33835cb532bcb1c6a52730212a4743bfd67f30aeddea55f6aabe","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:23:17.551348Z","signature_b64":"K7Ybj3ilNGkxNQ0GeRXTtmxsSgm3S1GYdtObTaoTcPPwlNryTFHfqAvQgDY261gALbyFP4SzMJKG50wn6jnMDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"241441384aae33835cb532bcb1c6a52730212a4743bfd67f30aeddea55f6aabe","last_reissued_at":"2026-05-18T01:23:17.550594Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:23:17.550594Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1601.01211","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-05-18T01:23:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AkkuJdF4DcgLcf5jB6agajIu06vZl+kHRu5mrplItydcpCvR/dyqhnz/bm8/I4sExWNFbcKndPaw1//K6TE/AA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T06:44:36.625976Z"},"content_sha256":"379e1369529f2a3adaa2c86710ecb739afec9c7635ff6b8b7d010b14c6bd1188","schema_version":"1.0","event_id":"sha256:379e1369529f2a3adaa2c86710ecb739afec9c7635ff6b8b7d010b14c6bd1188"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:EQKECOCKVYZYGXFVGK6LDRVFE4","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Density of 4-edge paths in graphs with fixed edge density","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"D\\'aniel T. Nagy","submitted_at":"2016-01-06T15:35:35Z","abstract_excerpt":"We investigate the number of 4-edge paths in graphs with a fixed number of vertices and edges. An asymptotically sharp upper bound is given to this quantity. The extremal construction is the quasi-star or the quasi-clique graph, depending on the edge density. An easy lower bound is also proved. This answer resembles the classic theorem of Ahlswede and Katona about the maximal number of 2-edge paths, and a recent theorem of Kenyon, Radin, Ren and Sadun about k-edge stars."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1601.01211","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":""},"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-18T01:23:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eXL+/fGPCojdT2cBdxwp6WYGXwwPHHkeYfO19w1Ne8XxycyJis5g1Nhx9Pq8xphR6VPGmiXUBEp1emysBkAgCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T06:44:36.626349Z"},"content_sha256":"138a49e11329c80005f57a651cb9659d6a7b47258db7f96d130d0895b24c50d9","schema_version":"1.0","event_id":"sha256:138a49e11329c80005f57a651cb9659d6a7b47258db7f96d130d0895b24c50d9"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/EQKECOCKVYZYGXFVGK6LDRVFE4/bundle.json","state_url":"https://pith.science/pith/EQKECOCKVYZYGXFVGK6LDRVFE4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/EQKECOCKVYZYGXFVGK6LDRVFE4/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-06-20T06:44:36Z","links":{"resolver":"https://pith.science/pith/EQKECOCKVYZYGXFVGK6LDRVFE4","bundle":"https://pith.science/pith/EQKECOCKVYZYGXFVGK6LDRVFE4/bundle.json","state":"https://pith.science/pith/EQKECOCKVYZYGXFVGK6LDRVFE4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/EQKECOCKVYZYGXFVGK6LDRVFE4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:EQKECOCKVYZYGXFVGK6LDRVFE4","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":"cfe6f3b2e3d1f78aa0bb7388e25d4e30c3109e6e7a7afe0ebe20a77298caa482","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-01-06T15:35:35Z","title_canon_sha256":"2c96b4b6f9dec84dd1745785c38766671fecb6768b2c121d3617c970b7a0ae40"},"schema_version":"1.0","source":{"id":"1601.01211","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1601.01211","created_at":"2026-05-18T01:23:17Z"},{"alias_kind":"arxiv_version","alias_value":"1601.01211v1","created_at":"2026-05-18T01:23:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1601.01211","created_at":"2026-05-18T01:23:17Z"},{"alias_kind":"pith_short_12","alias_value":"EQKECOCKVYZY","created_at":"2026-05-18T12:30:12Z"},{"alias_kind":"pith_short_16","alias_value":"EQKECOCKVYZYGXFV","created_at":"2026-05-18T12:30:12Z"},{"alias_kind":"pith_short_8","alias_value":"EQKECOCK","created_at":"2026-05-18T12:30:12Z"}],"graph_snapshots":[{"event_id":"sha256:138a49e11329c80005f57a651cb9659d6a7b47258db7f96d130d0895b24c50d9","target":"graph","created_at":"2026-05-18T01:23:17Z","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":"We investigate the number of 4-edge paths in graphs with a fixed number of vertices and edges. An asymptotically sharp upper bound is given to this quantity. The extremal construction is the quasi-star or the quasi-clique graph, depending on the edge density. An easy lower bound is also proved. This answer resembles the classic theorem of Ahlswede and Katona about the maximal number of 2-edge paths, and a recent theorem of Kenyon, Radin, Ren and Sadun about k-edge stars.","authors_text":"D\\'aniel T. Nagy","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-01-06T15:35:35Z","title":"Density of 4-edge paths in graphs with fixed edge density"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1601.01211","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:379e1369529f2a3adaa2c86710ecb739afec9c7635ff6b8b7d010b14c6bd1188","target":"record","created_at":"2026-05-18T01:23:17Z","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":"cfe6f3b2e3d1f78aa0bb7388e25d4e30c3109e6e7a7afe0ebe20a77298caa482","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-01-06T15:35:35Z","title_canon_sha256":"2c96b4b6f9dec84dd1745785c38766671fecb6768b2c121d3617c970b7a0ae40"},"schema_version":"1.0","source":{"id":"1601.01211","kind":"arxiv","version":1}},"canonical_sha256":"241441384aae33835cb532bcb1c6a52730212a4743bfd67f30aeddea55f6aabe","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"241441384aae33835cb532bcb1c6a52730212a4743bfd67f30aeddea55f6aabe","first_computed_at":"2026-05-18T01:23:17.550594Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:23:17.550594Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"K7Ybj3ilNGkxNQ0GeRXTtmxsSgm3S1GYdtObTaoTcPPwlNryTFHfqAvQgDY261gALbyFP4SzMJKG50wn6jnMDA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:23:17.551348Z","signed_message":"canonical_sha256_bytes"},"source_id":"1601.01211","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:379e1369529f2a3adaa2c86710ecb739afec9c7635ff6b8b7d010b14c6bd1188","sha256:138a49e11329c80005f57a651cb9659d6a7b47258db7f96d130d0895b24c50d9"],"state_sha256":"baccee72eb63573a49f5f92176bfc4e828f157d0111a04e17d0df9dc71a14045"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bNx9Er5jbvfZSyRxPAO6fqoi/YOTISBH5AImGh1AL6XRXK/kEu0TyEddvFkuSDuCG5QwW92F1Lwv4Z0eN7q8CA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-20T06:44:36.628193Z","bundle_sha256":"f800bd9582a6cabc888dd1a81debcc4d887e254b7e09df9809867a9273dca7a3"}}