{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2009:MNOWBPZM6LYUPVFML5NL7LEH3J","short_pith_number":"pith:MNOWBPZM","schema_version":"1.0","canonical_sha256":"635d60bf2cf2f147d4ac5f5abfac87da7de557a996fdf6d0d8e3969622ace068","source":{"kind":"arxiv","id":"0911.4378","version":2},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"0911.4378","created_at":"2026-05-18T03:02:44.515234+00:00"},{"alias_kind":"arxiv_version","alias_value":"0911.4378v2","created_at":"2026-05-18T03:02:44.515234+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0911.4378","created_at":"2026-05-18T03:02:44.515234+00:00"},{"alias_kind":"pith_short_12","alias_value":"MNOWBPZM6LYU","created_at":"2026-05-18T12:26:00.592388+00:00"},{"alias_kind":"pith_short_16","alias_value":"MNOWBPZM6LYUPVFM","created_at":"2026-05-18T12:26:00.592388+00:00"},{"alias_kind":"pith_short_8","alias_value":"MNOWBPZM","created_at":"2026-05-18T12:26:00.592388+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/MNOWBPZM6LYUPVFML5NL7LEH3J","json":"https://pith.science/pith/MNOWBPZM6LYUPVFML5NL7LEH3J.json","graph_json":"https://pith.science/api/pith-number/MNOWBPZM6LYUPVFML5NL7LEH3J/graph.json","events_json":"https://pith.science/api/pith-number/MNOWBPZM6LYUPVFML5NL7LEH3J/events.json","paper":"https://pith.science/paper/MNOWBPZM"},"agent_actions":{"view_html":"https://pith.science/pith/MNOWBPZM6LYUPVFML5NL7LEH3J","download_json":"https://pith.science/pith/MNOWBPZM6LYUPVFML5NL7LEH3J.json","view_paper":"https://pith.science/paper/MNOWBPZM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=0911.4378&json=true","fetch_graph":"https://pith.science/api/pith-number/MNOWBPZM6LYUPVFML5NL7LEH3J/graph.json","fetch_events":"https://pith.science/api/pith-number/MNOWBPZM6LYUPVFML5NL7LEH3J/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MNOWBPZM6LYUPVFML5NL7LEH3J/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MNOWBPZM6LYUPVFML5NL7LEH3J/action/storage_attestation","attest_author":"https://pith.science/pith/MNOWBPZM6LYUPVFML5NL7LEH3J/action/author_attestation","sign_citation":"https://pith.science/pith/MNOWBPZM6LYUPVFML5NL7LEH3J/action/citation_signature","submit_replication":"https://pith.science/pith/MNOWBPZM6LYUPVFML5NL7LEH3J/action/replication_record"}},"created_at":"2026-05-18T03:02:44.515234+00:00","updated_at":"2026-05-18T03:02:44.515234+00:00"}