{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2009:MNOWBPZM6LYUPVFML5NL7LEH3J","short_pith_number":"pith:MNOWBPZM","canonical_record":{"source":{"id":"0911.4378","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2009-11-23T11:54:01Z","cross_cats_sorted":[],"title_canon_sha256":"31a84ea88c9ae5189983459a308ec955429f3d7ca2e8ce98e224ee914c73c5c1","abstract_canon_sha256":"eeada8c2755370ac05e77373fdd7dda9786ec4914f73690ebfca2ce74756d06c"},"schema_version":"1.0"},"canonical_sha256":"635d60bf2cf2f147d4ac5f5abfac87da7de557a996fdf6d0d8e3969622ace068","source":{"kind":"arxiv","id":"0911.4378","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0911.4378","created_at":"2026-05-18T03:02:44Z"},{"alias_kind":"arxiv_version","alias_value":"0911.4378v2","created_at":"2026-05-18T03:02:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0911.4378","created_at":"2026-05-18T03:02:44Z"},{"alias_kind":"pith_short_12","alias_value":"MNOWBPZM6LYU","created_at":"2026-05-18T12:26:00Z"},{"alias_kind":"pith_short_16","alias_value":"MNOWBPZM6LYUPVFM","created_at":"2026-05-18T12:26:00Z"},{"alias_kind":"pith_short_8","alias_value":"MNOWBPZM","created_at":"2026-05-18T12:26:00Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2009:MNOWBPZM6LYUPVFML5NL7LEH3J","target":"record","payload":{"canonical_record":{"source":{"id":"0911.4378","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2009-11-23T11:54:01Z","cross_cats_sorted":[],"title_canon_sha256":"31a84ea88c9ae5189983459a308ec955429f3d7ca2e8ce98e224ee914c73c5c1","abstract_canon_sha256":"eeada8c2755370ac05e77373fdd7dda9786ec4914f73690ebfca2ce74756d06c"},"schema_version":"1.0"},"canonical_sha256":"635d60bf2cf2f147d4ac5f5abfac87da7de557a996fdf6d0d8e3969622ace068","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:02:44.515875Z","signature_b64":"ASWAaRVzqkXapZ69uFdOXeFBvkpbhQCAMiSkRTgS/3ia7EKWcraxujMUbTGffxEJuwRVylwPSK1o1fdUMdIhBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"635d60bf2cf2f147d4ac5f5abfac87da7de557a996fdf6d0d8e3969622ace068","last_reissued_at":"2026-05-18T03:02:44.515096Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:02:44.515096Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"0911.4378","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:02:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Xb6NE3X19e8Xv9FsiAXXpKR79MrtCpmkkUz0lNL9sYt4uXxOul/dJnD5ef2f9R2vfyv3R/0v3g2FlIURMAQSAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T18:42:33.627816Z"},"content_sha256":"a7342c9875fe4ad35d5bbeda0faebf0c24f3153ebe2ed781b92070aacc9c1658","schema_version":"1.0","event_id":"sha256:a7342c9875fe4ad35d5bbeda0faebf0c24f3153ebe2ed781b92070aacc9c1658"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2009:MNOWBPZM6LYUPVFML5NL7LEH3J","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Simple extensions of combinatorial structures","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Nik Ruskuc, Robert Brignall, Vince Vatter","submitted_at":"2009-11-23T11:54:01Z","abstract_excerpt":"An interval in a combinatorial structure S is a set I of points which relate to every point from S I in the same way. A structure is simple if it has no proper intervals. Every combinatorial structure can be expressed as an inflation of a simple structure by structures of smaller sizes -- this is called the substitution (or modular) decomposition. In this paper we prove several results of the following type: An arbitrary structure S of size n belonging to a class C can be embedded into a simple structure from C by adding at most f(n) elements. We prove such results when C is the class of all t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0911.4378","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:02:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GF/0Nzr0reWM5/htpVG9U4dXOFxgBCTxU8SD1MIhF0wytrUcNVj0njlmKq0u4Zu82XSeWuCXjFOl1tK+lq30BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T18:42:33.628160Z"},"content_sha256":"15d60e36b0b881a2cd6702b5c6872160817facbda0f02e1f9df61d601a5583cb","schema_version":"1.0","event_id":"sha256:15d60e36b0b881a2cd6702b5c6872160817facbda0f02e1f9df61d601a5583cb"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MNOWBPZM6LYUPVFML5NL7LEH3J/bundle.json","state_url":"https://pith.science/pith/MNOWBPZM6LYUPVFML5NL7LEH3J/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MNOWBPZM6LYUPVFML5NL7LEH3J/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-02T18:42:33Z","links":{"resolver":"https://pith.science/pith/MNOWBPZM6LYUPVFML5NL7LEH3J","bundle":"https://pith.science/pith/MNOWBPZM6LYUPVFML5NL7LEH3J/bundle.json","state":"https://pith.science/pith/MNOWBPZM6LYUPVFML5NL7LEH3J/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MNOWBPZM6LYUPVFML5NL7LEH3J/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2009:MNOWBPZM6LYUPVFML5NL7LEH3J","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":"eeada8c2755370ac05e77373fdd7dda9786ec4914f73690ebfca2ce74756d06c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2009-11-23T11:54:01Z","title_canon_sha256":"31a84ea88c9ae5189983459a308ec955429f3d7ca2e8ce98e224ee914c73c5c1"},"schema_version":"1.0","source":{"id":"0911.4378","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0911.4378","created_at":"2026-05-18T03:02:44Z"},{"alias_kind":"arxiv_version","alias_value":"0911.4378v2","created_at":"2026-05-18T03:02:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0911.4378","created_at":"2026-05-18T03:02:44Z"},{"alias_kind":"pith_short_12","alias_value":"MNOWBPZM6LYU","created_at":"2026-05-18T12:26:00Z"},{"alias_kind":"pith_short_16","alias_value":"MNOWBPZM6LYUPVFM","created_at":"2026-05-18T12:26:00Z"},{"alias_kind":"pith_short_8","alias_value":"MNOWBPZM","created_at":"2026-05-18T12:26:00Z"}],"graph_snapshots":[{"event_id":"sha256:15d60e36b0b881a2cd6702b5c6872160817facbda0f02e1f9df61d601a5583cb","target":"graph","created_at":"2026-05-18T03:02:44Z","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":"An interval in a combinatorial structure S is a set I of points which relate to every point from S I in the same way. A structure is simple if it has no proper intervals. Every combinatorial structure can be expressed as an inflation of a simple structure by structures of smaller sizes -- this is called the substitution (or modular) decomposition. In this paper we prove several results of the following type: An arbitrary structure S of size n belonging to a class C can be embedded into a simple structure from C by adding at most f(n) elements. We prove such results when C is the class of all t","authors_text":"Nik Ruskuc, Robert Brignall, Vince Vatter","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2009-11-23T11:54:01Z","title":"Simple extensions of combinatorial structures"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0911.4378","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:a7342c9875fe4ad35d5bbeda0faebf0c24f3153ebe2ed781b92070aacc9c1658","target":"record","created_at":"2026-05-18T03:02:44Z","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":"eeada8c2755370ac05e77373fdd7dda9786ec4914f73690ebfca2ce74756d06c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2009-11-23T11:54:01Z","title_canon_sha256":"31a84ea88c9ae5189983459a308ec955429f3d7ca2e8ce98e224ee914c73c5c1"},"schema_version":"1.0","source":{"id":"0911.4378","kind":"arxiv","version":2}},"canonical_sha256":"635d60bf2cf2f147d4ac5f5abfac87da7de557a996fdf6d0d8e3969622ace068","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"635d60bf2cf2f147d4ac5f5abfac87da7de557a996fdf6d0d8e3969622ace068","first_computed_at":"2026-05-18T03:02:44.515096Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:02:44.515096Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ASWAaRVzqkXapZ69uFdOXeFBvkpbhQCAMiSkRTgS/3ia7EKWcraxujMUbTGffxEJuwRVylwPSK1o1fdUMdIhBw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:02:44.515875Z","signed_message":"canonical_sha256_bytes"},"source_id":"0911.4378","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a7342c9875fe4ad35d5bbeda0faebf0c24f3153ebe2ed781b92070aacc9c1658","sha256:15d60e36b0b881a2cd6702b5c6872160817facbda0f02e1f9df61d601a5583cb"],"state_sha256":"27d1ba88aa29151502478ba429914a6d7736d7d843f5c46fef42545d4a89f587"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4nJcZSZ+bhdMAQ7rwPn0gEF36WZsR1MCJmEjXGgJBbjEl88OUfbwtFsIfT3uq1E8k/VqqALPuXsYOIbvzYFxBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T18:42:33.630061Z","bundle_sha256":"39e796aab2c6b12a689af27c400d986d769010dd2c7d029daf3e66fd96fe2ffc"}}