{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:67RLFMPFG4C5X6J4CT3DF5M3QJ","short_pith_number":"pith:67RLFMPF","schema_version":"1.0","canonical_sha256":"f7e2b2b1e53705dbf93c14f632f59b8275a3e8aa6d24aa429ad374eddba18544","source":{"kind":"arxiv","id":"1302.6039","version":2},"attestation_state":"computed","paper":{"title":"Sperner's problem for G-independent families","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Victor Falgas-Ravry","submitted_at":"2013-02-25T10:40:01Z","abstract_excerpt":"Given a graph G, let Q(G) denote the collection of all independent (edge-free) sets of vertices in G. We consider the problem of determining the size of a largest antichain in Q(G).\n  When G is the edge-less graph, this problem is resolved by Sperner's Theorem. In this paper, we focus on the case where G is the path of length n-1, proving the size of a maximal antichain is of the same order as the size of a largest layer of Q(G)."},"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":"1302.6039","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-02-25T10:40:01Z","cross_cats_sorted":[],"title_canon_sha256":"67bde6c87ded0ef9b54e6c7f9955bb030de6203edbf073687c5a754b156c48b7","abstract_canon_sha256":"4ccad64e25b94850a8c6a01fd449b70f9a228a6ece5944a3104c10accd65bf17"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:11:21.719354Z","signature_b64":"42GveuyT5TqbcxX1Z5ycAeSsAM9dOlqxG2D4QUxPSq/XapFDTsiUwM57naHhZHRpOJAc+zza6KUtN2LaTqSFAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f7e2b2b1e53705dbf93c14f632f59b8275a3e8aa6d24aa429ad374eddba18544","last_reissued_at":"2026-05-18T03:11:21.718598Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:11:21.718598Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Sperner's problem for G-independent families","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Victor Falgas-Ravry","submitted_at":"2013-02-25T10:40:01Z","abstract_excerpt":"Given a graph G, let Q(G) denote the collection of all independent (edge-free) sets of vertices in G. We consider the problem of determining the size of a largest antichain in Q(G).\n  When G is the edge-less graph, this problem is resolved by Sperner's Theorem. In this paper, we focus on the case where G is the path of length n-1, proving the size of a maximal antichain is of the same order as the size of a largest layer of Q(G)."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1302.6039","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":"1302.6039","created_at":"2026-05-18T03:11:21.718707+00:00"},{"alias_kind":"arxiv_version","alias_value":"1302.6039v2","created_at":"2026-05-18T03:11:21.718707+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1302.6039","created_at":"2026-05-18T03:11:21.718707+00:00"},{"alias_kind":"pith_short_12","alias_value":"67RLFMPFG4C5","created_at":"2026-05-18T12:27:36.564083+00:00"},{"alias_kind":"pith_short_16","alias_value":"67RLFMPFG4C5X6J4","created_at":"2026-05-18T12:27:36.564083+00:00"},{"alias_kind":"pith_short_8","alias_value":"67RLFMPF","created_at":"2026-05-18T12:27:36.564083+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/67RLFMPFG4C5X6J4CT3DF5M3QJ","json":"https://pith.science/pith/67RLFMPFG4C5X6J4CT3DF5M3QJ.json","graph_json":"https://pith.science/api/pith-number/67RLFMPFG4C5X6J4CT3DF5M3QJ/graph.json","events_json":"https://pith.science/api/pith-number/67RLFMPFG4C5X6J4CT3DF5M3QJ/events.json","paper":"https://pith.science/paper/67RLFMPF"},"agent_actions":{"view_html":"https://pith.science/pith/67RLFMPFG4C5X6J4CT3DF5M3QJ","download_json":"https://pith.science/pith/67RLFMPFG4C5X6J4CT3DF5M3QJ.json","view_paper":"https://pith.science/paper/67RLFMPF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1302.6039&json=true","fetch_graph":"https://pith.science/api/pith-number/67RLFMPFG4C5X6J4CT3DF5M3QJ/graph.json","fetch_events":"https://pith.science/api/pith-number/67RLFMPFG4C5X6J4CT3DF5M3QJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/67RLFMPFG4C5X6J4CT3DF5M3QJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/67RLFMPFG4C5X6J4CT3DF5M3QJ/action/storage_attestation","attest_author":"https://pith.science/pith/67RLFMPFG4C5X6J4CT3DF5M3QJ/action/author_attestation","sign_citation":"https://pith.science/pith/67RLFMPFG4C5X6J4CT3DF5M3QJ/action/citation_signature","submit_replication":"https://pith.science/pith/67RLFMPFG4C5X6J4CT3DF5M3QJ/action/replication_record"}},"created_at":"2026-05-18T03:11:21.718707+00:00","updated_at":"2026-05-18T03:11:21.718707+00:00"}