{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:BSY2VT4O6S7TB7EABWLMSN7X4S","short_pith_number":"pith:BSY2VT4O","schema_version":"1.0","canonical_sha256":"0cb1aacf8ef4bf30fc800d96c937f7e49bedbb3c50ff882d489743b8dfbd455e","source":{"kind":"arxiv","id":"1210.8189","version":2},"attestation_state":"computed","paper":{"title":"Forbidden Configurations: Finding the number predicted by the Anstee-Sali Conjecture is NP-hard","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"Miguel Raggi","submitted_at":"2012-10-30T22:21:49Z","abstract_excerpt":"Let F be a hypergraph and let forb(m,F) denote the maximum number of edges a hypergraph with m vertices can have if it doesn't contain F as a subhypergraph. A conjecture of Anstee and Sali predicts the asymptotic behaviour of forb(m,F) for fixed F. In this paper we prove that even finding this predicted asymptotic behaviour is an NP-hard problem, meaning that if the Anstee-Sali conjecture were true, finding the asymptotics of forb(m,F) would be NP-hard."},"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":"1210.8189","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2012-10-30T22:21:49Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"a68de18a73c090316c9cbbae8b4921d62b54b7bf2a08f5f0043b09589d24c4e3","abstract_canon_sha256":"697055a8b98165a3460530af138b7a7ba2bc20b79dba820ada4a92e2dec86620"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:35:13.551110Z","signature_b64":"nXAQl6HoP6xbtAa9g/e2RapO7qCQmKVOjU5no7ejqzI7H8c0B7PqNR9CMT1GiabFV5cr6Uf064nFu08Rp/uHCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0cb1aacf8ef4bf30fc800d96c937f7e49bedbb3c50ff882d489743b8dfbd455e","last_reissued_at":"2026-05-18T03:35:13.550478Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:35:13.550478Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Forbidden Configurations: Finding the number predicted by the Anstee-Sali Conjecture is NP-hard","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"Miguel Raggi","submitted_at":"2012-10-30T22:21:49Z","abstract_excerpt":"Let F be a hypergraph and let forb(m,F) denote the maximum number of edges a hypergraph with m vertices can have if it doesn't contain F as a subhypergraph. A conjecture of Anstee and Sali predicts the asymptotic behaviour of forb(m,F) for fixed F. In this paper we prove that even finding this predicted asymptotic behaviour is an NP-hard problem, meaning that if the Anstee-Sali conjecture were true, finding the asymptotics of forb(m,F) would be NP-hard."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1210.8189","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":"1210.8189","created_at":"2026-05-18T03:35:13.550596+00:00"},{"alias_kind":"arxiv_version","alias_value":"1210.8189v2","created_at":"2026-05-18T03:35:13.550596+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1210.8189","created_at":"2026-05-18T03:35:13.550596+00:00"},{"alias_kind":"pith_short_12","alias_value":"BSY2VT4O6S7T","created_at":"2026-05-18T12:27:01.376967+00:00"},{"alias_kind":"pith_short_16","alias_value":"BSY2VT4O6S7TB7EA","created_at":"2026-05-18T12:27:01.376967+00:00"},{"alias_kind":"pith_short_8","alias_value":"BSY2VT4O","created_at":"2026-05-18T12:27:01.376967+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/BSY2VT4O6S7TB7EABWLMSN7X4S","json":"https://pith.science/pith/BSY2VT4O6S7TB7EABWLMSN7X4S.json","graph_json":"https://pith.science/api/pith-number/BSY2VT4O6S7TB7EABWLMSN7X4S/graph.json","events_json":"https://pith.science/api/pith-number/BSY2VT4O6S7TB7EABWLMSN7X4S/events.json","paper":"https://pith.science/paper/BSY2VT4O"},"agent_actions":{"view_html":"https://pith.science/pith/BSY2VT4O6S7TB7EABWLMSN7X4S","download_json":"https://pith.science/pith/BSY2VT4O6S7TB7EABWLMSN7X4S.json","view_paper":"https://pith.science/paper/BSY2VT4O","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1210.8189&json=true","fetch_graph":"https://pith.science/api/pith-number/BSY2VT4O6S7TB7EABWLMSN7X4S/graph.json","fetch_events":"https://pith.science/api/pith-number/BSY2VT4O6S7TB7EABWLMSN7X4S/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BSY2VT4O6S7TB7EABWLMSN7X4S/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BSY2VT4O6S7TB7EABWLMSN7X4S/action/storage_attestation","attest_author":"https://pith.science/pith/BSY2VT4O6S7TB7EABWLMSN7X4S/action/author_attestation","sign_citation":"https://pith.science/pith/BSY2VT4O6S7TB7EABWLMSN7X4S/action/citation_signature","submit_replication":"https://pith.science/pith/BSY2VT4O6S7TB7EABWLMSN7X4S/action/replication_record"}},"created_at":"2026-05-18T03:35:13.550596+00:00","updated_at":"2026-05-18T03:35:13.550596+00:00"}