{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2008:BJGLR7BH6PKPT7KGNL7NIAG6D3","short_pith_number":"pith:BJGLR7BH","canonical_record":{"source":{"id":"0802.3491","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2008-02-24T05:20:49Z","cross_cats_sorted":[],"title_canon_sha256":"aa6c6558ebdbd36fcd8d6bc07d92d1e041e852990791fa50faa98b58e9e3aeac","abstract_canon_sha256":"5e53cf2b85789c0ea6f6cb226d444a8d3dcbbc52bd256fa4ef1f762c79936688"},"schema_version":"1.0"},"canonical_sha256":"0a4cb8fc27f3d4f9fd466afed400de1ee979b5c8b2d340e196396025d044a017","source":{"kind":"arxiv","id":"0802.3491","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0802.3491","created_at":"2026-07-04T15:09:47Z"},{"alias_kind":"arxiv_version","alias_value":"0802.3491v1","created_at":"2026-07-04T15:09:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0802.3491","created_at":"2026-07-04T15:09:47Z"},{"alias_kind":"pith_short_12","alias_value":"BJGLR7BH6PKP","created_at":"2026-07-04T15:09:47Z"},{"alias_kind":"pith_short_16","alias_value":"BJGLR7BH6PKPT7KG","created_at":"2026-07-04T15:09:47Z"},{"alias_kind":"pith_short_8","alias_value":"BJGLR7BH","created_at":"2026-07-04T15:09:47Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2008:BJGLR7BH6PKPT7KGNL7NIAG6D3","target":"record","payload":{"canonical_record":{"source":{"id":"0802.3491","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2008-02-24T05:20:49Z","cross_cats_sorted":[],"title_canon_sha256":"aa6c6558ebdbd36fcd8d6bc07d92d1e041e852990791fa50faa98b58e9e3aeac","abstract_canon_sha256":"5e53cf2b85789c0ea6f6cb226d444a8d3dcbbc52bd256fa4ef1f762c79936688"},"schema_version":"1.0"},"canonical_sha256":"0a4cb8fc27f3d4f9fd466afed400de1ee979b5c8b2d340e196396025d044a017","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T15:09:47.052716Z","signature_b64":"L93FwN7L/nQ5L3aPK4UKbq4zcsIRxDMN+vGwEZ9+mlCbCVz5F6tI/a9aehX9mRRou14sT5s2pK/c9nW+mhVaAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0a4cb8fc27f3d4f9fd466afed400de1ee979b5c8b2d340e196396025d044a017","last_reissued_at":"2026-07-04T15:09:47.052280Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T15:09:47.052280Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"0802.3491","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-07-04T15:09:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sNp54wCgAyg8ZqiC0oeRHQlgAE3t2251h24oTWF6WDExEG1hN0ozI+o7WkOihpGTFSeCze1QPD0VlDx/KrCNAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-13T11:43:10.905505Z"},"content_sha256":"e4a327392e1abf1a2f9ad32e679afb53253d9b369fc39d113f452dbb702e41e2","schema_version":"1.0","event_id":"sha256:e4a327392e1abf1a2f9ad32e679afb53253d9b369fc39d113f452dbb702e41e2"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2008:BJGLR7BH6PKPT7KGNL7NIAG6D3","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Efficient Counting and Asymptotics of $k$-noncrossing tangled-diagrams","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Christian M. Reidys, Doron Zeilberger, Jing Qin, William Y. C. Chen","submitted_at":"2008-02-24T05:20:49Z","abstract_excerpt":"In this paper we enumerate $k$-noncrossing tangled-diagrams. A tangled-diagram is a labeled graph whose vertices are $1,...,n$ have degree $\\le 2$, and are arranged in increasing order in a horizontal line. Its arcs are drawn in the upper halfplane with a particular notion of crossings and nestings. Our main result is the asymptotic formula for the number of $k$-noncrossing tangled-diagrams $T_{k}(n) \\sim c_k n^{-((k-1)^2+(k-1)/2)} (4(k-1)^2+2(k-1)+1)^n$ for some $c_k>0$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0802.3491","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/0802.3491/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-04T15:09:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"veUMY937m1w6pSMJwOWZWeBVNJfZMHTy9tnkC5ZbjHEo/qEXC+MCkbkSnyOvcsOhmK4reQBAidJ0W/RcC0OtAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-13T11:43:10.905955Z"},"content_sha256":"ed01c17a966c194c49e9f28e1e5c0bfbfdd70d3888b68f9198d6848e5319f1d9","schema_version":"1.0","event_id":"sha256:ed01c17a966c194c49e9f28e1e5c0bfbfdd70d3888b68f9198d6848e5319f1d9"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BJGLR7BH6PKPT7KGNL7NIAG6D3/bundle.json","state_url":"https://pith.science/pith/BJGLR7BH6PKPT7KGNL7NIAG6D3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BJGLR7BH6PKPT7KGNL7NIAG6D3/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-08-13T11:43:10Z","links":{"resolver":"https://pith.science/pith/BJGLR7BH6PKPT7KGNL7NIAG6D3","bundle":"https://pith.science/pith/BJGLR7BH6PKPT7KGNL7NIAG6D3/bundle.json","state":"https://pith.science/pith/BJGLR7BH6PKPT7KGNL7NIAG6D3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BJGLR7BH6PKPT7KGNL7NIAG6D3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2008:BJGLR7BH6PKPT7KGNL7NIAG6D3","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":"5e53cf2b85789c0ea6f6cb226d444a8d3dcbbc52bd256fa4ef1f762c79936688","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2008-02-24T05:20:49Z","title_canon_sha256":"aa6c6558ebdbd36fcd8d6bc07d92d1e041e852990791fa50faa98b58e9e3aeac"},"schema_version":"1.0","source":{"id":"0802.3491","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0802.3491","created_at":"2026-07-04T15:09:47Z"},{"alias_kind":"arxiv_version","alias_value":"0802.3491v1","created_at":"2026-07-04T15:09:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0802.3491","created_at":"2026-07-04T15:09:47Z"},{"alias_kind":"pith_short_12","alias_value":"BJGLR7BH6PKP","created_at":"2026-07-04T15:09:47Z"},{"alias_kind":"pith_short_16","alias_value":"BJGLR7BH6PKPT7KG","created_at":"2026-07-04T15:09:47Z"},{"alias_kind":"pith_short_8","alias_value":"BJGLR7BH","created_at":"2026-07-04T15:09:47Z"}],"graph_snapshots":[{"event_id":"sha256:ed01c17a966c194c49e9f28e1e5c0bfbfdd70d3888b68f9198d6848e5319f1d9","target":"graph","created_at":"2026-07-04T15:09:47Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/0802.3491/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"In this paper we enumerate $k$-noncrossing tangled-diagrams. A tangled-diagram is a labeled graph whose vertices are $1,...,n$ have degree $\\le 2$, and are arranged in increasing order in a horizontal line. Its arcs are drawn in the upper halfplane with a particular notion of crossings and nestings. Our main result is the asymptotic formula for the number of $k$-noncrossing tangled-diagrams $T_{k}(n) \\sim c_k n^{-((k-1)^2+(k-1)/2)} (4(k-1)^2+2(k-1)+1)^n$ for some $c_k>0$.","authors_text":"Christian M. Reidys, Doron Zeilberger, Jing Qin, William Y. C. Chen","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2008-02-24T05:20:49Z","title":"Efficient Counting and Asymptotics of $k$-noncrossing tangled-diagrams"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0802.3491","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:e4a327392e1abf1a2f9ad32e679afb53253d9b369fc39d113f452dbb702e41e2","target":"record","created_at":"2026-07-04T15:09:47Z","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":"5e53cf2b85789c0ea6f6cb226d444a8d3dcbbc52bd256fa4ef1f762c79936688","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2008-02-24T05:20:49Z","title_canon_sha256":"aa6c6558ebdbd36fcd8d6bc07d92d1e041e852990791fa50faa98b58e9e3aeac"},"schema_version":"1.0","source":{"id":"0802.3491","kind":"arxiv","version":1}},"canonical_sha256":"0a4cb8fc27f3d4f9fd466afed400de1ee979b5c8b2d340e196396025d044a017","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0a4cb8fc27f3d4f9fd466afed400de1ee979b5c8b2d340e196396025d044a017","first_computed_at":"2026-07-04T15:09:47.052280Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-04T15:09:47.052280Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"L93FwN7L/nQ5L3aPK4UKbq4zcsIRxDMN+vGwEZ9+mlCbCVz5F6tI/a9aehX9mRRou14sT5s2pK/c9nW+mhVaAQ==","signature_status":"signed_v1","signed_at":"2026-07-04T15:09:47.052716Z","signed_message":"canonical_sha256_bytes"},"source_id":"0802.3491","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e4a327392e1abf1a2f9ad32e679afb53253d9b369fc39d113f452dbb702e41e2","sha256:ed01c17a966c194c49e9f28e1e5c0bfbfdd70d3888b68f9198d6848e5319f1d9"],"state_sha256":"e2c354db4ebb7d2589d37574fb2f14b7a0984f335446ff327bcc19f5b2fee783"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aUueTyg7jCCM3n60MB19VcBoLcE1x0B7amyK7unt8mpT76yFSejPATpf/fARbUTGWXUFJaXlbMNJYy+7sQmQAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-13T11:43:10.909004Z","bundle_sha256":"686c02dcf82b3203fc942a5d607ad41e9e926eef5e64cd7b209fd284c845b0b6"}}