{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:KQMJZ7SLTYV2KI5YC2ST5PDYB7","short_pith_number":"pith:KQMJZ7SL","canonical_record":{"source":{"id":"1210.8424","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-10-31T18:10:25Z","cross_cats_sorted":[],"title_canon_sha256":"2c0ca3e3a45e67f2674184fa151a1e9ed25541aea16bc151223c010eb8e28055","abstract_canon_sha256":"c47e15832fdeb594db8ae2b02ddd72effc467e69da830de9a0c8b1511baaec38"},"schema_version":"1.0"},"canonical_sha256":"54189cfe4b9e2ba523b816a53ebc780fc9cf2142301a7eca888d92ea7c991c35","source":{"kind":"arxiv","id":"1210.8424","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1210.8424","created_at":"2026-05-18T03:41:43Z"},{"alias_kind":"arxiv_version","alias_value":"1210.8424v1","created_at":"2026-05-18T03:41:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1210.8424","created_at":"2026-05-18T03:41:43Z"},{"alias_kind":"pith_short_12","alias_value":"KQMJZ7SLTYV2","created_at":"2026-05-18T12:27:11Z"},{"alias_kind":"pith_short_16","alias_value":"KQMJZ7SLTYV2KI5Y","created_at":"2026-05-18T12:27:11Z"},{"alias_kind":"pith_short_8","alias_value":"KQMJZ7SL","created_at":"2026-05-18T12:27:11Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:KQMJZ7SLTYV2KI5YC2ST5PDYB7","target":"record","payload":{"canonical_record":{"source":{"id":"1210.8424","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-10-31T18:10:25Z","cross_cats_sorted":[],"title_canon_sha256":"2c0ca3e3a45e67f2674184fa151a1e9ed25541aea16bc151223c010eb8e28055","abstract_canon_sha256":"c47e15832fdeb594db8ae2b02ddd72effc467e69da830de9a0c8b1511baaec38"},"schema_version":"1.0"},"canonical_sha256":"54189cfe4b9e2ba523b816a53ebc780fc9cf2142301a7eca888d92ea7c991c35","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:41:43.436326Z","signature_b64":"fpBiiVRXs9RPXHHtbvirO6rCyLpIDyoO64zTLV3fKL/+XWLlK8bVx85DA2Rlq1Qb/zB326QlYbDQFlQFJeRZBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"54189cfe4b9e2ba523b816a53ebc780fc9cf2142301a7eca888d92ea7c991c35","last_reissued_at":"2026-05-18T03:41:43.435577Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:41:43.435577Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1210.8424","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-18T03:41:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"O7pfPBTCFp/xdUbLhpOHRZvYYzcY7Ih/pf62/dKlM+eBIsHdvcPraLsnT3Kc6ElSXdieXeZBUnoxxWpOpiaTDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T13:28:38.944128Z"},"content_sha256":"9d6886aa766a4142362abea2ec2cd9c7132dd1e840cc2ad6181d532339a1570c","schema_version":"1.0","event_id":"sha256:9d6886aa766a4142362abea2ec2cd9c7132dd1e840cc2ad6181d532339a1570c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:KQMJZ7SLTYV2KI5YC2ST5PDYB7","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Counting paths in digraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Blair D. Sullivan, Paul Seymour","submitted_at":"2012-10-31T18:10:25Z","abstract_excerpt":"Say a digraph is k-free if it has no directed cycles of length at most k, for positive integers k. Thomasse conjectured that the number of induced 3-vertex directed paths in a simple 2-free digraph on n vertices is at most (n-1)n(n+1)/15. We present an unpublished result of Bondy proving that there are at most 2n^3/25 such paths, and prove that for the class of circular interval digraphs, an upper bound of n^3/16 holds. We also study the problem of bounding the number of (non-induced) 4-vertex paths in 3-free digraphs. We show an upper bound of 4n^4/75 using Bondy's result for Thomasse's conje"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1210.8424","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-18T03:41:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oyUFejvPK1hXwHPna23YSL/Y5TLRdInIS9O1d1ZPZDb3cmVsY5GPY5y2OIbeZNDSQ6D0QToLleRPeexwGvpSDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T13:28:38.944842Z"},"content_sha256":"404efd2dc2f1fd21fb681d8551521d9f697f67435739988552ed81d858fc86aa","schema_version":"1.0","event_id":"sha256:404efd2dc2f1fd21fb681d8551521d9f697f67435739988552ed81d858fc86aa"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KQMJZ7SLTYV2KI5YC2ST5PDYB7/bundle.json","state_url":"https://pith.science/pith/KQMJZ7SLTYV2KI5YC2ST5PDYB7/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KQMJZ7SLTYV2KI5YC2ST5PDYB7/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-28T13:28:38Z","links":{"resolver":"https://pith.science/pith/KQMJZ7SLTYV2KI5YC2ST5PDYB7","bundle":"https://pith.science/pith/KQMJZ7SLTYV2KI5YC2ST5PDYB7/bundle.json","state":"https://pith.science/pith/KQMJZ7SLTYV2KI5YC2ST5PDYB7/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KQMJZ7SLTYV2KI5YC2ST5PDYB7/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:KQMJZ7SLTYV2KI5YC2ST5PDYB7","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":"c47e15832fdeb594db8ae2b02ddd72effc467e69da830de9a0c8b1511baaec38","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-10-31T18:10:25Z","title_canon_sha256":"2c0ca3e3a45e67f2674184fa151a1e9ed25541aea16bc151223c010eb8e28055"},"schema_version":"1.0","source":{"id":"1210.8424","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1210.8424","created_at":"2026-05-18T03:41:43Z"},{"alias_kind":"arxiv_version","alias_value":"1210.8424v1","created_at":"2026-05-18T03:41:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1210.8424","created_at":"2026-05-18T03:41:43Z"},{"alias_kind":"pith_short_12","alias_value":"KQMJZ7SLTYV2","created_at":"2026-05-18T12:27:11Z"},{"alias_kind":"pith_short_16","alias_value":"KQMJZ7SLTYV2KI5Y","created_at":"2026-05-18T12:27:11Z"},{"alias_kind":"pith_short_8","alias_value":"KQMJZ7SL","created_at":"2026-05-18T12:27:11Z"}],"graph_snapshots":[{"event_id":"sha256:404efd2dc2f1fd21fb681d8551521d9f697f67435739988552ed81d858fc86aa","target":"graph","created_at":"2026-05-18T03:41:43Z","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":"Say a digraph is k-free if it has no directed cycles of length at most k, for positive integers k. Thomasse conjectured that the number of induced 3-vertex directed paths in a simple 2-free digraph on n vertices is at most (n-1)n(n+1)/15. We present an unpublished result of Bondy proving that there are at most 2n^3/25 such paths, and prove that for the class of circular interval digraphs, an upper bound of n^3/16 holds. We also study the problem of bounding the number of (non-induced) 4-vertex paths in 3-free digraphs. We show an upper bound of 4n^4/75 using Bondy's result for Thomasse's conje","authors_text":"Blair D. Sullivan, Paul Seymour","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-10-31T18:10:25Z","title":"Counting paths in digraphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1210.8424","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:9d6886aa766a4142362abea2ec2cd9c7132dd1e840cc2ad6181d532339a1570c","target":"record","created_at":"2026-05-18T03:41:43Z","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":"c47e15832fdeb594db8ae2b02ddd72effc467e69da830de9a0c8b1511baaec38","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-10-31T18:10:25Z","title_canon_sha256":"2c0ca3e3a45e67f2674184fa151a1e9ed25541aea16bc151223c010eb8e28055"},"schema_version":"1.0","source":{"id":"1210.8424","kind":"arxiv","version":1}},"canonical_sha256":"54189cfe4b9e2ba523b816a53ebc780fc9cf2142301a7eca888d92ea7c991c35","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"54189cfe4b9e2ba523b816a53ebc780fc9cf2142301a7eca888d92ea7c991c35","first_computed_at":"2026-05-18T03:41:43.435577Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:41:43.435577Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"fpBiiVRXs9RPXHHtbvirO6rCyLpIDyoO64zTLV3fKL/+XWLlK8bVx85DA2Rlq1Qb/zB326QlYbDQFlQFJeRZBw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:41:43.436326Z","signed_message":"canonical_sha256_bytes"},"source_id":"1210.8424","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9d6886aa766a4142362abea2ec2cd9c7132dd1e840cc2ad6181d532339a1570c","sha256:404efd2dc2f1fd21fb681d8551521d9f697f67435739988552ed81d858fc86aa"],"state_sha256":"dc1a3f55b9e557a80e14f6c2ad406b94c5db1eeedefba6f647323054fe28ed01"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZfjKKI6emZ/SGBJAy3UWyFgTP3GbffJwQhfMVYbW2OYl2GFMmbRv3TbnXCa+I8vb/kpBcTnHgyV4ykPCCzgACw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T13:28:38.947083Z","bundle_sha256":"3c7e660ad3cf7cbdfe0c80c1c78af17c0ecb601c8be35a6bdf829ec0ea299351"}}