{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:67RLFMPFG4C5X6J4CT3DF5M3QJ","short_pith_number":"pith:67RLFMPF","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"},"canonical_sha256":"f7e2b2b1e53705dbf93c14f632f59b8275a3e8aa6d24aa429ad374eddba18544","source":{"kind":"arxiv","id":"1302.6039","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1302.6039","created_at":"2026-05-18T03:11:21Z"},{"alias_kind":"arxiv_version","alias_value":"1302.6039v2","created_at":"2026-05-18T03:11:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1302.6039","created_at":"2026-05-18T03:11:21Z"},{"alias_kind":"pith_short_12","alias_value":"67RLFMPFG4C5","created_at":"2026-05-18T12:27:36Z"},{"alias_kind":"pith_short_16","alias_value":"67RLFMPFG4C5X6J4","created_at":"2026-05-18T12:27:36Z"},{"alias_kind":"pith_short_8","alias_value":"67RLFMPF","created_at":"2026-05-18T12:27:36Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:67RLFMPFG4C5X6J4CT3DF5M3QJ","target":"record","payload":{"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"},"canonical_sha256":"f7e2b2b1e53705dbf93c14f632f59b8275a3e8aa6d24aa429ad374eddba18544","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"},"source_kind":"arxiv","source_id":"1302.6039","source_version":2,"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-05-18T03:11:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kCNWz0Cc1yFlONJlHT5/37ccC7/CKLEqoNnhAEU8rtVdkpgWvXAQ0zp+AxsSvWof1L+yPrntqTxwz90IFWRAAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T00:18:23.041391Z"},"content_sha256":"690187ce709cfd6945a4458165db27034a5b41ec00bd8cee317e0759a341f40d","schema_version":"1.0","event_id":"sha256:690187ce709cfd6945a4458165db27034a5b41ec00bd8cee317e0759a341f40d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:67RLFMPFG4C5X6J4CT3DF5M3QJ","target":"graph","payload":{"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"},"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-05-18T03:11:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qszYKyIblX7SnCm+vPJ6YS5pzvmEdOyF/OPkLax+1Sc//9NBlz1f+zWz0B8cYoUtRk3zKeOeL6sjTm01a7faDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T00:18:23.041752Z"},"content_sha256":"95e9f0a0ae112bd13cdbf02141783c80f3181f182cc8d0b48adfe0ce5f328c36","schema_version":"1.0","event_id":"sha256:95e9f0a0ae112bd13cdbf02141783c80f3181f182cc8d0b48adfe0ce5f328c36"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/67RLFMPFG4C5X6J4CT3DF5M3QJ/bundle.json","state_url":"https://pith.science/pith/67RLFMPFG4C5X6J4CT3DF5M3QJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/67RLFMPFG4C5X6J4CT3DF5M3QJ/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-06-03T00:18:23Z","links":{"resolver":"https://pith.science/pith/67RLFMPFG4C5X6J4CT3DF5M3QJ","bundle":"https://pith.science/pith/67RLFMPFG4C5X6J4CT3DF5M3QJ/bundle.json","state":"https://pith.science/pith/67RLFMPFG4C5X6J4CT3DF5M3QJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/67RLFMPFG4C5X6J4CT3DF5M3QJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:67RLFMPFG4C5X6J4CT3DF5M3QJ","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":"4ccad64e25b94850a8c6a01fd449b70f9a228a6ece5944a3104c10accd65bf17","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-02-25T10:40:01Z","title_canon_sha256":"67bde6c87ded0ef9b54e6c7f9955bb030de6203edbf073687c5a754b156c48b7"},"schema_version":"1.0","source":{"id":"1302.6039","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1302.6039","created_at":"2026-05-18T03:11:21Z"},{"alias_kind":"arxiv_version","alias_value":"1302.6039v2","created_at":"2026-05-18T03:11:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1302.6039","created_at":"2026-05-18T03:11:21Z"},{"alias_kind":"pith_short_12","alias_value":"67RLFMPFG4C5","created_at":"2026-05-18T12:27:36Z"},{"alias_kind":"pith_short_16","alias_value":"67RLFMPFG4C5X6J4","created_at":"2026-05-18T12:27:36Z"},{"alias_kind":"pith_short_8","alias_value":"67RLFMPF","created_at":"2026-05-18T12:27:36Z"}],"graph_snapshots":[{"event_id":"sha256:95e9f0a0ae112bd13cdbf02141783c80f3181f182cc8d0b48adfe0ce5f328c36","target":"graph","created_at":"2026-05-18T03:11:21Z","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"},"paper":{"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).","authors_text":"Victor Falgas-Ravry","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-02-25T10:40:01Z","title":"Sperner's problem for G-independent families"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1302.6039","kind":"arxiv","version":2},"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:690187ce709cfd6945a4458165db27034a5b41ec00bd8cee317e0759a341f40d","target":"record","created_at":"2026-05-18T03:11:21Z","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":"4ccad64e25b94850a8c6a01fd449b70f9a228a6ece5944a3104c10accd65bf17","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-02-25T10:40:01Z","title_canon_sha256":"67bde6c87ded0ef9b54e6c7f9955bb030de6203edbf073687c5a754b156c48b7"},"schema_version":"1.0","source":{"id":"1302.6039","kind":"arxiv","version":2}},"canonical_sha256":"f7e2b2b1e53705dbf93c14f632f59b8275a3e8aa6d24aa429ad374eddba18544","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f7e2b2b1e53705dbf93c14f632f59b8275a3e8aa6d24aa429ad374eddba18544","first_computed_at":"2026-05-18T03:11:21.718598Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:11:21.718598Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"42GveuyT5TqbcxX1Z5ycAeSsAM9dOlqxG2D4QUxPSq/XapFDTsiUwM57naHhZHRpOJAc+zza6KUtN2LaTqSFAg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:11:21.719354Z","signed_message":"canonical_sha256_bytes"},"source_id":"1302.6039","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:690187ce709cfd6945a4458165db27034a5b41ec00bd8cee317e0759a341f40d","sha256:95e9f0a0ae112bd13cdbf02141783c80f3181f182cc8d0b48adfe0ce5f328c36"],"state_sha256":"3d7df8b736a82b4c3948cb8a516d665805c67c840d6bbc3f29adabdb78cf57b7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CwCtSQp6FZHr0axGA2sQGau4L5+QumIidlYvcs+jd1WbaYabIVu+PK4ALmlfK/BHw7Gt/a1riBMos64RNQyZAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T00:18:23.043789Z","bundle_sha256":"9823ca23352c791d8970067325349d31dd3619700a2b4dfc92165a932f49b2f9"}}