{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:KTWPKQMDOXSXABG2LR3GFVJHEY","short_pith_number":"pith:KTWPKQMD","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"},"canonical_sha256":"54ecf5418375e57004da5c7662d527263a4ba5d79ea78def9fa036d9a720a504","source":{"kind":"arxiv","id":"1504.04993","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1504.04993","created_at":"2026-05-18T02:18:23Z"},{"alias_kind":"arxiv_version","alias_value":"1504.04993v1","created_at":"2026-05-18T02:18:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.04993","created_at":"2026-05-18T02:18:23Z"},{"alias_kind":"pith_short_12","alias_value":"KTWPKQMDOXSX","created_at":"2026-05-18T12:29:29Z"},{"alias_kind":"pith_short_16","alias_value":"KTWPKQMDOXSXABG2","created_at":"2026-05-18T12:29:29Z"},{"alias_kind":"pith_short_8","alias_value":"KTWPKQMD","created_at":"2026-05-18T12:29:29Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:KTWPKQMDOXSXABG2LR3GFVJHEY","target":"record","payload":{"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"},"canonical_sha256":"54ecf5418375e57004da5c7662d527263a4ba5d79ea78def9fa036d9a720a504","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"},"source_kind":"arxiv","source_id":"1504.04993","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-18T02:18:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Tzw/zNkhwKAOR5ZpweEip3E/ebE57UCrqChC4A22Ji9vdSdLwcCfits2jO8v59Efm/PRoTCJEseWfnFH+ic/Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T20:36:40.886956Z"},"content_sha256":"d64ce9e5fa517c20bc442ebe4d3b40d473e1dc521d70bfd834aaf855fc3c6cf7","schema_version":"1.0","event_id":"sha256:d64ce9e5fa517c20bc442ebe4d3b40d473e1dc521d70bfd834aaf855fc3c6cf7"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:KTWPKQMDOXSXABG2LR3GFVJHEY","target":"graph","payload":{"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"},"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-18T02:18:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zrCYgipSZnnzSAD0MjBj25RldpNmqNXWGBamDuYpF0uq2gWyORjlPJZl04lLVfF001zLdIUdZjezVkMYj3lVBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T20:36:40.887430Z"},"content_sha256":"142fcf6d77912f6c03ea94140217a14e50ee667f819a8b9c6c348987895ee26d","schema_version":"1.0","event_id":"sha256:142fcf6d77912f6c03ea94140217a14e50ee667f819a8b9c6c348987895ee26d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KTWPKQMDOXSXABG2LR3GFVJHEY/bundle.json","state_url":"https://pith.science/pith/KTWPKQMDOXSXABG2LR3GFVJHEY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KTWPKQMDOXSXABG2LR3GFVJHEY/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-24T20:36:40Z","links":{"resolver":"https://pith.science/pith/KTWPKQMDOXSXABG2LR3GFVJHEY","bundle":"https://pith.science/pith/KTWPKQMDOXSXABG2LR3GFVJHEY/bundle.json","state":"https://pith.science/pith/KTWPKQMDOXSXABG2LR3GFVJHEY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KTWPKQMDOXSXABG2LR3GFVJHEY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:KTWPKQMDOXSXABG2LR3GFVJHEY","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":"fd1c401bdf551cd9972ce73bea63c05dc86ec4386b034648a15d470961e9f391","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-04-20T09:58:53Z","title_canon_sha256":"f11eda79fb266c8055f566e86a7a04fbc4c48110bfbdfa09b376542c68601ce7"},"schema_version":"1.0","source":{"id":"1504.04993","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1504.04993","created_at":"2026-05-18T02:18:23Z"},{"alias_kind":"arxiv_version","alias_value":"1504.04993v1","created_at":"2026-05-18T02:18:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.04993","created_at":"2026-05-18T02:18:23Z"},{"alias_kind":"pith_short_12","alias_value":"KTWPKQMDOXSX","created_at":"2026-05-18T12:29:29Z"},{"alias_kind":"pith_short_16","alias_value":"KTWPKQMDOXSXABG2","created_at":"2026-05-18T12:29:29Z"},{"alias_kind":"pith_short_8","alias_value":"KTWPKQMD","created_at":"2026-05-18T12:29:29Z"}],"graph_snapshots":[{"event_id":"sha256:142fcf6d77912f6c03ea94140217a14e50ee667f819a8b9c6c348987895ee26d","target":"graph","created_at":"2026-05-18T02:18:23Z","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":"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","authors_text":"Marco Kuhlmann","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-04-20T09:58:53Z","title":"Tabulation of Noncrossing Acyclic Digraphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1504.04993","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:d64ce9e5fa517c20bc442ebe4d3b40d473e1dc521d70bfd834aaf855fc3c6cf7","target":"record","created_at":"2026-05-18T02:18:23Z","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":"fd1c401bdf551cd9972ce73bea63c05dc86ec4386b034648a15d470961e9f391","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-04-20T09:58:53Z","title_canon_sha256":"f11eda79fb266c8055f566e86a7a04fbc4c48110bfbdfa09b376542c68601ce7"},"schema_version":"1.0","source":{"id":"1504.04993","kind":"arxiv","version":1}},"canonical_sha256":"54ecf5418375e57004da5c7662d527263a4ba5d79ea78def9fa036d9a720a504","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"54ecf5418375e57004da5c7662d527263a4ba5d79ea78def9fa036d9a720a504","first_computed_at":"2026-05-18T02:18:23.020413Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:18:23.020413Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ko4GPVpH9us2NTteGv1Blaq/4n6U4bXb011uCWcX7LS/6Yu0c1zkpxlckx6m7fAvmKjGxhXYUoVvyvXYjXCbDg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:18:23.021147Z","signed_message":"canonical_sha256_bytes"},"source_id":"1504.04993","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d64ce9e5fa517c20bc442ebe4d3b40d473e1dc521d70bfd834aaf855fc3c6cf7","sha256:142fcf6d77912f6c03ea94140217a14e50ee667f819a8b9c6c348987895ee26d"],"state_sha256":"7d4c41cc0abcc0ec7d029a87a0c61680e736c73a2658dbb95a76a936aaed9e72"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gQli6Vq0mAYTQHYgX9SGVlp66HagKz/a0488sAnShLz4YYKLS1/wWkz11Fise4EP1oumCjsmZAqtZvhI1QnmBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-24T20:36:40.889970Z","bundle_sha256":"6de5055aff423b433267815a0ae597c6f991b929926da395b515bf00622f4fab"}}