{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:KTWPKQMDOXSXABG2LR3GFVJHEY","short_pith_number":"pith:KTWPKQMD","schema_version":"1.0","canonical_sha256":"54ecf5418375e57004da5c7662d527263a4ba5d79ea78def9fa036d9a720a504","source":{"kind":"arxiv","id":"1504.04993","version":1},"attestation_state":"computed","paper":{"title":"Tabulation of Noncrossing Acyclic Digraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DS","authors_text":"Marco Kuhlmann","submitted_at":"2015-04-20T09:58:53Z","abstract_excerpt":"I present an algorithm that, given a number $n \\geq 1$, computes a compact representation of the set of all noncrossing acyclic digraphs with $n$ nodes. This compact representation can be used as the basis for a wide range of dynamic programming algorithms on these graphs. As an illustration, along with this note I am releasing the implementation of an algorithm for counting the number of noncrossing acyclic digraphs of a given size. The same tabulation can be modified to count other classes of combinatorial structures, including weakly connected noncrossing acyclic digraphs, general noncrossi"},"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":"1504.04993","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-04-20T09:58:53Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"f11eda79fb266c8055f566e86a7a04fbc4c48110bfbdfa09b376542c68601ce7","abstract_canon_sha256":"fd1c401bdf551cd9972ce73bea63c05dc86ec4386b034648a15d470961e9f391"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:18:23.021147Z","signature_b64":"ko4GPVpH9us2NTteGv1Blaq/4n6U4bXb011uCWcX7LS/6Yu0c1zkpxlckx6m7fAvmKjGxhXYUoVvyvXYjXCbDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"54ecf5418375e57004da5c7662d527263a4ba5d79ea78def9fa036d9a720a504","last_reissued_at":"2026-05-18T02:18:23.020413Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:18:23.020413Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Tabulation of Noncrossing Acyclic Digraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DS","authors_text":"Marco Kuhlmann","submitted_at":"2015-04-20T09:58:53Z","abstract_excerpt":"I present an algorithm that, given a number $n \\geq 1$, computes a compact representation of the set of all noncrossing acyclic digraphs with $n$ nodes. This compact representation can be used as the basis for a wide range of dynamic programming algorithms on these graphs. As an illustration, along with this note I am releasing the implementation of an algorithm for counting the number of noncrossing acyclic digraphs of a given size. The same tabulation can be modified to count other classes of combinatorial structures, including weakly connected noncrossing acyclic digraphs, general noncrossi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1504.04993","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":"1504.04993","created_at":"2026-05-18T02:18:23.020535+00:00"},{"alias_kind":"arxiv_version","alias_value":"1504.04993v1","created_at":"2026-05-18T02:18:23.020535+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.04993","created_at":"2026-05-18T02:18:23.020535+00:00"},{"alias_kind":"pith_short_12","alias_value":"KTWPKQMDOXSX","created_at":"2026-05-18T12:29:29.992203+00:00"},{"alias_kind":"pith_short_16","alias_value":"KTWPKQMDOXSXABG2","created_at":"2026-05-18T12:29:29.992203+00:00"},{"alias_kind":"pith_short_8","alias_value":"KTWPKQMD","created_at":"2026-05-18T12:29:29.992203+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/KTWPKQMDOXSXABG2LR3GFVJHEY","json":"https://pith.science/pith/KTWPKQMDOXSXABG2LR3GFVJHEY.json","graph_json":"https://pith.science/api/pith-number/KTWPKQMDOXSXABG2LR3GFVJHEY/graph.json","events_json":"https://pith.science/api/pith-number/KTWPKQMDOXSXABG2LR3GFVJHEY/events.json","paper":"https://pith.science/paper/KTWPKQMD"},"agent_actions":{"view_html":"https://pith.science/pith/KTWPKQMDOXSXABG2LR3GFVJHEY","download_json":"https://pith.science/pith/KTWPKQMDOXSXABG2LR3GFVJHEY.json","view_paper":"https://pith.science/paper/KTWPKQMD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1504.04993&json=true","fetch_graph":"https://pith.science/api/pith-number/KTWPKQMDOXSXABG2LR3GFVJHEY/graph.json","fetch_events":"https://pith.science/api/pith-number/KTWPKQMDOXSXABG2LR3GFVJHEY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KTWPKQMDOXSXABG2LR3GFVJHEY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KTWPKQMDOXSXABG2LR3GFVJHEY/action/storage_attestation","attest_author":"https://pith.science/pith/KTWPKQMDOXSXABG2LR3GFVJHEY/action/author_attestation","sign_citation":"https://pith.science/pith/KTWPKQMDOXSXABG2LR3GFVJHEY/action/citation_signature","submit_replication":"https://pith.science/pith/KTWPKQMDOXSXABG2LR3GFVJHEY/action/replication_record"}},"created_at":"2026-05-18T02:18:23.020535+00:00","updated_at":"2026-05-18T02:18:23.020535+00:00"}