{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:LAG62ZU3SHZDBF7KJWBC5MLJNK","short_pith_number":"pith:LAG62ZU3","canonical_record":{"source":{"id":"1607.04902","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.LO","submitted_at":"2016-07-17T18:40:12Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"d55c3a9b758622568a8d1af37a773c3f98917c2621d66cbed084a043726df8f8","abstract_canon_sha256":"28c93fc2a1965d0d667830eea4bc73a9d48cd160277530630008fabe734484e1"},"schema_version":"1.0"},"canonical_sha256":"580ded669b91f23097ea4d822eb1696a8b23f76f3f229e3e0768d42cb7005e54","source":{"kind":"arxiv","id":"1607.04902","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1607.04902","created_at":"2026-05-18T01:10:46Z"},{"alias_kind":"arxiv_version","alias_value":"1607.04902v2","created_at":"2026-05-18T01:10:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.04902","created_at":"2026-05-18T01:10:46Z"},{"alias_kind":"pith_short_12","alias_value":"LAG62ZU3SHZD","created_at":"2026-05-18T12:30:29Z"},{"alias_kind":"pith_short_16","alias_value":"LAG62ZU3SHZDBF7K","created_at":"2026-05-18T12:30:29Z"},{"alias_kind":"pith_short_8","alias_value":"LAG62ZU3","created_at":"2026-05-18T12:30:29Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:LAG62ZU3SHZDBF7KJWBC5MLJNK","target":"record","payload":{"canonical_record":{"source":{"id":"1607.04902","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.LO","submitted_at":"2016-07-17T18:40:12Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"d55c3a9b758622568a8d1af37a773c3f98917c2621d66cbed084a043726df8f8","abstract_canon_sha256":"28c93fc2a1965d0d667830eea4bc73a9d48cd160277530630008fabe734484e1"},"schema_version":"1.0"},"canonical_sha256":"580ded669b91f23097ea4d822eb1696a8b23f76f3f229e3e0768d42cb7005e54","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:10:46.963444Z","signature_b64":"vLKxvsdKaRIZOP0tUhfJGe9hwfVEkkqEyu3UK+lbbHHnpbA3+fQYsSEOAVIz8SMsZCivyLsFmE0hMjxKP7pJDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"580ded669b91f23097ea4d822eb1696a8b23f76f3f229e3e0768d42cb7005e54","last_reissued_at":"2026-05-18T01:10:46.962918Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:10:46.962918Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1607.04902","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-18T01:10:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IuOKmPXY6n9EM4F3Qys97i69BOX2nJJozWCdFp5YP//yinJEG5NBVtFqMUOL52KaJjURzzNatkHBX9S0Y3CJDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T10:02:22.203924Z"},"content_sha256":"9844ea4fc4459678106c1bf9e0823b37bd0c1734a5bcd6ffb62a6715e1d7f660","schema_version":"1.0","event_id":"sha256:9844ea4fc4459678106c1bf9e0823b37bd0c1734a5bcd6ffb62a6715e1d7f660"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:LAG62ZU3SHZDBF7KJWBC5MLJNK","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Structure and enumeration theorems for hereditary properties in finite relational languages","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"math.LO","authors_text":"Caroline Terry","submitted_at":"2016-07-17T18:40:12Z","abstract_excerpt":"Given a finite relational language $\\calL$, a hereditary $\\calL$-property is a class of finite $\\calL$-structures which is closed under isomorphism and model theoretic substructure. This notion encompasses many objects of study in extremal combinatorics, including (but not limited to) hereditary properties of graphs, hypergraphs, and oriented graphs. In this paper, we generalize certain definitions, tools, and results form the study of hereditary properties in combinatorics to the setting of hereditary $\\calL$-properties, where $\\calL$ is any finite relational language with maximum arity at le"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1607.04902","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-18T01:10:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"v6uiRhOVSRcfqFTSfBEmt11IsCL8OZyul25Ra+emjXoT8cMzS++AoxAU4nYamrC/tdL/LpfMHo4hzeijmhUSCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T10:02:22.204262Z"},"content_sha256":"7c0f3b4786f0275b41925a14908acd0c6a4f30f13367c564f7b3409bb4716aac","schema_version":"1.0","event_id":"sha256:7c0f3b4786f0275b41925a14908acd0c6a4f30f13367c564f7b3409bb4716aac"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LAG62ZU3SHZDBF7KJWBC5MLJNK/bundle.json","state_url":"https://pith.science/pith/LAG62ZU3SHZDBF7KJWBC5MLJNK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LAG62ZU3SHZDBF7KJWBC5MLJNK/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-08T10:02:22Z","links":{"resolver":"https://pith.science/pith/LAG62ZU3SHZDBF7KJWBC5MLJNK","bundle":"https://pith.science/pith/LAG62ZU3SHZDBF7KJWBC5MLJNK/bundle.json","state":"https://pith.science/pith/LAG62ZU3SHZDBF7KJWBC5MLJNK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LAG62ZU3SHZDBF7KJWBC5MLJNK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:LAG62ZU3SHZDBF7KJWBC5MLJNK","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":"28c93fc2a1965d0d667830eea4bc73a9d48cd160277530630008fabe734484e1","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.LO","submitted_at":"2016-07-17T18:40:12Z","title_canon_sha256":"d55c3a9b758622568a8d1af37a773c3f98917c2621d66cbed084a043726df8f8"},"schema_version":"1.0","source":{"id":"1607.04902","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1607.04902","created_at":"2026-05-18T01:10:46Z"},{"alias_kind":"arxiv_version","alias_value":"1607.04902v2","created_at":"2026-05-18T01:10:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.04902","created_at":"2026-05-18T01:10:46Z"},{"alias_kind":"pith_short_12","alias_value":"LAG62ZU3SHZD","created_at":"2026-05-18T12:30:29Z"},{"alias_kind":"pith_short_16","alias_value":"LAG62ZU3SHZDBF7K","created_at":"2026-05-18T12:30:29Z"},{"alias_kind":"pith_short_8","alias_value":"LAG62ZU3","created_at":"2026-05-18T12:30:29Z"}],"graph_snapshots":[{"event_id":"sha256:7c0f3b4786f0275b41925a14908acd0c6a4f30f13367c564f7b3409bb4716aac","target":"graph","created_at":"2026-05-18T01:10:46Z","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 finite relational language $\\calL$, a hereditary $\\calL$-property is a class of finite $\\calL$-structures which is closed under isomorphism and model theoretic substructure. This notion encompasses many objects of study in extremal combinatorics, including (but not limited to) hereditary properties of graphs, hypergraphs, and oriented graphs. In this paper, we generalize certain definitions, tools, and results form the study of hereditary properties in combinatorics to the setting of hereditary $\\calL$-properties, where $\\calL$ is any finite relational language with maximum arity at le","authors_text":"Caroline Terry","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.LO","submitted_at":"2016-07-17T18:40:12Z","title":"Structure and enumeration theorems for hereditary properties in finite relational languages"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1607.04902","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:9844ea4fc4459678106c1bf9e0823b37bd0c1734a5bcd6ffb62a6715e1d7f660","target":"record","created_at":"2026-05-18T01:10:46Z","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":"28c93fc2a1965d0d667830eea4bc73a9d48cd160277530630008fabe734484e1","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.LO","submitted_at":"2016-07-17T18:40:12Z","title_canon_sha256":"d55c3a9b758622568a8d1af37a773c3f98917c2621d66cbed084a043726df8f8"},"schema_version":"1.0","source":{"id":"1607.04902","kind":"arxiv","version":2}},"canonical_sha256":"580ded669b91f23097ea4d822eb1696a8b23f76f3f229e3e0768d42cb7005e54","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"580ded669b91f23097ea4d822eb1696a8b23f76f3f229e3e0768d42cb7005e54","first_computed_at":"2026-05-18T01:10:46.962918Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:10:46.962918Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"vLKxvsdKaRIZOP0tUhfJGe9hwfVEkkqEyu3UK+lbbHHnpbA3+fQYsSEOAVIz8SMsZCivyLsFmE0hMjxKP7pJDA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:10:46.963444Z","signed_message":"canonical_sha256_bytes"},"source_id":"1607.04902","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9844ea4fc4459678106c1bf9e0823b37bd0c1734a5bcd6ffb62a6715e1d7f660","sha256:7c0f3b4786f0275b41925a14908acd0c6a4f30f13367c564f7b3409bb4716aac"],"state_sha256":"66ba03c96bf4b28154ec2ab9c10c042c67ce9d3385a1da62ddf9e32bcfab9326"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iqXph+HnW3qY6HOotIPEN+hih3bup8vXWhipvDgoF8Jrnsza78ePNRyfTKPqz7R/GH/+iNIb6Ny1xk87SiLeAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-08T10:02:22.206247Z","bundle_sha256":"5ba005d65762d1655d9f0801ff4a2ec7bf418aed95ca1dc0dd07e4685f3481d9"}}