{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:EAOAAZD2PSOJFXDS4KFIY25WIH","short_pith_number":"pith:EAOAAZD2","schema_version":"1.0","canonical_sha256":"201c00647a7c9c92dc72e28a8c6bb641fae0b48dd2ece872b452c43e0f0fde7e","source":{"kind":"arxiv","id":"1803.06636","version":2},"attestation_state":"computed","paper":{"title":"Complexity problems in enumerative combinatorics","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.DM","math.HO","math.PR"],"primary_cat":"math.CO","authors_text":"Igor Pak","submitted_at":"2018-03-18T10:31:54Z","abstract_excerpt":"We give a broad survey of recent results in Enumerative Combinatorics and their complexity aspects."},"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":"1803.06636","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-03-18T10:31:54Z","cross_cats_sorted":["cs.CC","cs.DM","math.HO","math.PR"],"title_canon_sha256":"b3d7ff377d44c0649e65aef433aeaa2ef62226051cd0623d88c91b44d28b8314","abstract_canon_sha256":"0e62331d1f452c809df3505cbdd3986361dd715bdbce174c50e85249503342ad"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:19:40.982727Z","signature_b64":"7v5VcnZ3eHdEJVIycx8eUuoxnFDRJgwmSH/DOUdPWbxNEfsBng2Sb0aS3HgrNLW1HpgZfHtWTN5XmCrzmBb5Aw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"201c00647a7c9c92dc72e28a8c6bb641fae0b48dd2ece872b452c43e0f0fde7e","last_reissued_at":"2026-05-18T00:19:40.982128Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:19:40.982128Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Complexity problems in enumerative combinatorics","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.DM","math.HO","math.PR"],"primary_cat":"math.CO","authors_text":"Igor Pak","submitted_at":"2018-03-18T10:31:54Z","abstract_excerpt":"We give a broad survey of recent results in Enumerative Combinatorics and their complexity aspects."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.06636","kind":"arxiv","version":2},"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":"1803.06636","created_at":"2026-05-18T00:19:40.982210+00:00"},{"alias_kind":"arxiv_version","alias_value":"1803.06636v2","created_at":"2026-05-18T00:19:40.982210+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.06636","created_at":"2026-05-18T00:19:40.982210+00:00"},{"alias_kind":"pith_short_12","alias_value":"EAOAAZD2PSOJ","created_at":"2026-05-18T12:32:22.470017+00:00"},{"alias_kind":"pith_short_16","alias_value":"EAOAAZD2PSOJFXDS","created_at":"2026-05-18T12:32:22.470017+00:00"},{"alias_kind":"pith_short_8","alias_value":"EAOAAZD2","created_at":"2026-05-18T12:32:22.470017+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/EAOAAZD2PSOJFXDS4KFIY25WIH","json":"https://pith.science/pith/EAOAAZD2PSOJFXDS4KFIY25WIH.json","graph_json":"https://pith.science/api/pith-number/EAOAAZD2PSOJFXDS4KFIY25WIH/graph.json","events_json":"https://pith.science/api/pith-number/EAOAAZD2PSOJFXDS4KFIY25WIH/events.json","paper":"https://pith.science/paper/EAOAAZD2"},"agent_actions":{"view_html":"https://pith.science/pith/EAOAAZD2PSOJFXDS4KFIY25WIH","download_json":"https://pith.science/pith/EAOAAZD2PSOJFXDS4KFIY25WIH.json","view_paper":"https://pith.science/paper/EAOAAZD2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1803.06636&json=true","fetch_graph":"https://pith.science/api/pith-number/EAOAAZD2PSOJFXDS4KFIY25WIH/graph.json","fetch_events":"https://pith.science/api/pith-number/EAOAAZD2PSOJFXDS4KFIY25WIH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EAOAAZD2PSOJFXDS4KFIY25WIH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EAOAAZD2PSOJFXDS4KFIY25WIH/action/storage_attestation","attest_author":"https://pith.science/pith/EAOAAZD2PSOJFXDS4KFIY25WIH/action/author_attestation","sign_citation":"https://pith.science/pith/EAOAAZD2PSOJFXDS4KFIY25WIH/action/citation_signature","submit_replication":"https://pith.science/pith/EAOAAZD2PSOJFXDS4KFIY25WIH/action/replication_record"}},"created_at":"2026-05-18T00:19:40.982210+00:00","updated_at":"2026-05-18T00:19:40.982210+00:00"}