{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:XYDRMMORG3QQ36B5BH7GJ2BKXD","short_pith_number":"pith:XYDRMMOR","schema_version":"1.0","canonical_sha256":"be071631d136e10df83d09fe64e82ab8d09ca3b8301689786161a07f4e75e240","source":{"kind":"arxiv","id":"1403.7656","version":1},"attestation_state":"computed","paper":{"title":"A short proof of the Deutsch-Sagan congruence for connected non crossing graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Ira M. Gessel","submitted_at":"2014-03-29T18:11:44Z","abstract_excerpt":"We give a short proof, using Lagrange inversion, of a congruence modulo 3 for the number of connected noncrossing graphs on n vertices that was conjectured by Emeric Deutsch and Bruce Sagan. A more complicated proof had been given earlier by S.-P. Eu, S.-C. Liu, and Y.-N. Yeh."},"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":"1403.7656","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-03-29T18:11:44Z","cross_cats_sorted":[],"title_canon_sha256":"fc4f522f4cb5371a9fa942fc749521e34b8554eae1c903a4ee63f32cc4ba36b1","abstract_canon_sha256":"85a041b3e6f93dc934330e854a3330a178a5a4674030ada3dbd425b27ba86bb9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:55:12.763689Z","signature_b64":"CdU3FfIyuue9LNZ+CA1PE/n/6SeHg2zFhBAU46XJ5jxRY6wtDxyhr8+W7AHA7POZzOu9kvaxL7nhIPxRgS1VBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"be071631d136e10df83d09fe64e82ab8d09ca3b8301689786161a07f4e75e240","last_reissued_at":"2026-05-18T02:55:12.763157Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:55:12.763157Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A short proof of the Deutsch-Sagan congruence for connected non crossing graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Ira M. Gessel","submitted_at":"2014-03-29T18:11:44Z","abstract_excerpt":"We give a short proof, using Lagrange inversion, of a congruence modulo 3 for the number of connected noncrossing graphs on n vertices that was conjectured by Emeric Deutsch and Bruce Sagan. A more complicated proof had been given earlier by S.-P. Eu, S.-C. Liu, and Y.-N. Yeh."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1403.7656","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":"1403.7656","created_at":"2026-05-18T02:55:12.763226+00:00"},{"alias_kind":"arxiv_version","alias_value":"1403.7656v1","created_at":"2026-05-18T02:55:12.763226+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1403.7656","created_at":"2026-05-18T02:55:12.763226+00:00"},{"alias_kind":"pith_short_12","alias_value":"XYDRMMORG3QQ","created_at":"2026-05-18T12:28:57.508820+00:00"},{"alias_kind":"pith_short_16","alias_value":"XYDRMMORG3QQ36B5","created_at":"2026-05-18T12:28:57.508820+00:00"},{"alias_kind":"pith_short_8","alias_value":"XYDRMMOR","created_at":"2026-05-18T12:28:57.508820+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/XYDRMMORG3QQ36B5BH7GJ2BKXD","json":"https://pith.science/pith/XYDRMMORG3QQ36B5BH7GJ2BKXD.json","graph_json":"https://pith.science/api/pith-number/XYDRMMORG3QQ36B5BH7GJ2BKXD/graph.json","events_json":"https://pith.science/api/pith-number/XYDRMMORG3QQ36B5BH7GJ2BKXD/events.json","paper":"https://pith.science/paper/XYDRMMOR"},"agent_actions":{"view_html":"https://pith.science/pith/XYDRMMORG3QQ36B5BH7GJ2BKXD","download_json":"https://pith.science/pith/XYDRMMORG3QQ36B5BH7GJ2BKXD.json","view_paper":"https://pith.science/paper/XYDRMMOR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1403.7656&json=true","fetch_graph":"https://pith.science/api/pith-number/XYDRMMORG3QQ36B5BH7GJ2BKXD/graph.json","fetch_events":"https://pith.science/api/pith-number/XYDRMMORG3QQ36B5BH7GJ2BKXD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XYDRMMORG3QQ36B5BH7GJ2BKXD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XYDRMMORG3QQ36B5BH7GJ2BKXD/action/storage_attestation","attest_author":"https://pith.science/pith/XYDRMMORG3QQ36B5BH7GJ2BKXD/action/author_attestation","sign_citation":"https://pith.science/pith/XYDRMMORG3QQ36B5BH7GJ2BKXD/action/citation_signature","submit_replication":"https://pith.science/pith/XYDRMMORG3QQ36B5BH7GJ2BKXD/action/replication_record"}},"created_at":"2026-05-18T02:55:12.763226+00:00","updated_at":"2026-05-18T02:55:12.763226+00:00"}