{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:KQMJZ7SLTYV2KI5YC2ST5PDYB7","short_pith_number":"pith:KQMJZ7SL","schema_version":"1.0","canonical_sha256":"54189cfe4b9e2ba523b816a53ebc780fc9cf2142301a7eca888d92ea7c991c35","source":{"kind":"arxiv","id":"1210.8424","version":1},"attestation_state":"computed","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1210.8424","created_at":"2026-05-18T03:41:43.435700+00:00"},{"alias_kind":"arxiv_version","alias_value":"1210.8424v1","created_at":"2026-05-18T03:41:43.435700+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1210.8424","created_at":"2026-05-18T03:41:43.435700+00:00"},{"alias_kind":"pith_short_12","alias_value":"KQMJZ7SLTYV2","created_at":"2026-05-18T12:27:11.947152+00:00"},{"alias_kind":"pith_short_16","alias_value":"KQMJZ7SLTYV2KI5Y","created_at":"2026-05-18T12:27:11.947152+00:00"},{"alias_kind":"pith_short_8","alias_value":"KQMJZ7SL","created_at":"2026-05-18T12:27:11.947152+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/KQMJZ7SLTYV2KI5YC2ST5PDYB7","json":"https://pith.science/pith/KQMJZ7SLTYV2KI5YC2ST5PDYB7.json","graph_json":"https://pith.science/api/pith-number/KQMJZ7SLTYV2KI5YC2ST5PDYB7/graph.json","events_json":"https://pith.science/api/pith-number/KQMJZ7SLTYV2KI5YC2ST5PDYB7/events.json","paper":"https://pith.science/paper/KQMJZ7SL"},"agent_actions":{"view_html":"https://pith.science/pith/KQMJZ7SLTYV2KI5YC2ST5PDYB7","download_json":"https://pith.science/pith/KQMJZ7SLTYV2KI5YC2ST5PDYB7.json","view_paper":"https://pith.science/paper/KQMJZ7SL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1210.8424&json=true","fetch_graph":"https://pith.science/api/pith-number/KQMJZ7SLTYV2KI5YC2ST5PDYB7/graph.json","fetch_events":"https://pith.science/api/pith-number/KQMJZ7SLTYV2KI5YC2ST5PDYB7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KQMJZ7SLTYV2KI5YC2ST5PDYB7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KQMJZ7SLTYV2KI5YC2ST5PDYB7/action/storage_attestation","attest_author":"https://pith.science/pith/KQMJZ7SLTYV2KI5YC2ST5PDYB7/action/author_attestation","sign_citation":"https://pith.science/pith/KQMJZ7SLTYV2KI5YC2ST5PDYB7/action/citation_signature","submit_replication":"https://pith.science/pith/KQMJZ7SLTYV2KI5YC2ST5PDYB7/action/replication_record"}},"created_at":"2026-05-18T03:41:43.435700+00:00","updated_at":"2026-05-18T03:41:43.435700+00:00"}