{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:OYDCUJNXZS4LABSVJCUOBLVYAB","short_pith_number":"pith:OYDCUJNX","schema_version":"1.0","canonical_sha256":"76062a25b7ccb8b0065548a8e0aeb80052c065e94b2af655a5ee144691d10a16","source":{"kind":"arxiv","id":"1708.02088","version":1},"attestation_state":"computed","paper":{"title":"Finite subgraphs of an extension graph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.GT"],"primary_cat":"math.GR","authors_text":"Juyoung Lee, Sang-hyun Kim, Thomas Koberda","submitted_at":"2017-08-07T12:17:47Z","abstract_excerpt":"Let $\\Gamma$ be a finite graph and let $\\Gamma^{\\mathrm{e}}$ be its extension graph. We inductively define a sequence $\\{\\Gamma_i\\}$ of finite induced subgraphs of $\\Gamma^{\\mathrm{e}}$ through successive applications of an operation called \"doubling along a star\". Then we show that every finite induced subgraph of $\\Gamma^{\\mathrm{e}}$ is isomorphic to an induced subgraph of some $\\Gamma_i$."},"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":"1708.02088","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GR","submitted_at":"2017-08-07T12:17:47Z","cross_cats_sorted":["math.GT"],"title_canon_sha256":"70854c1c2972e455ff1bbb2e61d7519911117a957622f8680db346db8371c281","abstract_canon_sha256":"9d9c69b4327025e8826ea87e255f79fda9bcbd1ef1ddde696a50003c8a57a47b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:38:32.336849Z","signature_b64":"hBafWWIzBmfJDXwRcRNqav7JZqfWHL1Bl8Je1ggAuUSP1TV7csNf1R2vW8rinVeRaSFriVBkQWvvhM4UzoE9Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"76062a25b7ccb8b0065548a8e0aeb80052c065e94b2af655a5ee144691d10a16","last_reissued_at":"2026-05-18T00:38:32.336362Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:38:32.336362Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Finite subgraphs of an extension graph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.GT"],"primary_cat":"math.GR","authors_text":"Juyoung Lee, Sang-hyun Kim, Thomas Koberda","submitted_at":"2017-08-07T12:17:47Z","abstract_excerpt":"Let $\\Gamma$ be a finite graph and let $\\Gamma^{\\mathrm{e}}$ be its extension graph. We inductively define a sequence $\\{\\Gamma_i\\}$ of finite induced subgraphs of $\\Gamma^{\\mathrm{e}}$ through successive applications of an operation called \"doubling along a star\". Then we show that every finite induced subgraph of $\\Gamma^{\\mathrm{e}}$ is isomorphic to an induced subgraph of some $\\Gamma_i$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.02088","kind":"arxiv","version":1},"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":"1708.02088","created_at":"2026-05-18T00:38:32.336418+00:00"},{"alias_kind":"arxiv_version","alias_value":"1708.02088v1","created_at":"2026-05-18T00:38:32.336418+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.02088","created_at":"2026-05-18T00:38:32.336418+00:00"},{"alias_kind":"pith_short_12","alias_value":"OYDCUJNXZS4L","created_at":"2026-05-18T12:31:34.259226+00:00"},{"alias_kind":"pith_short_16","alias_value":"OYDCUJNXZS4LABSV","created_at":"2026-05-18T12:31:34.259226+00:00"},{"alias_kind":"pith_short_8","alias_value":"OYDCUJNX","created_at":"2026-05-18T12:31:34.259226+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/OYDCUJNXZS4LABSVJCUOBLVYAB","json":"https://pith.science/pith/OYDCUJNXZS4LABSVJCUOBLVYAB.json","graph_json":"https://pith.science/api/pith-number/OYDCUJNXZS4LABSVJCUOBLVYAB/graph.json","events_json":"https://pith.science/api/pith-number/OYDCUJNXZS4LABSVJCUOBLVYAB/events.json","paper":"https://pith.science/paper/OYDCUJNX"},"agent_actions":{"view_html":"https://pith.science/pith/OYDCUJNXZS4LABSVJCUOBLVYAB","download_json":"https://pith.science/pith/OYDCUJNXZS4LABSVJCUOBLVYAB.json","view_paper":"https://pith.science/paper/OYDCUJNX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1708.02088&json=true","fetch_graph":"https://pith.science/api/pith-number/OYDCUJNXZS4LABSVJCUOBLVYAB/graph.json","fetch_events":"https://pith.science/api/pith-number/OYDCUJNXZS4LABSVJCUOBLVYAB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OYDCUJNXZS4LABSVJCUOBLVYAB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OYDCUJNXZS4LABSVJCUOBLVYAB/action/storage_attestation","attest_author":"https://pith.science/pith/OYDCUJNXZS4LABSVJCUOBLVYAB/action/author_attestation","sign_citation":"https://pith.science/pith/OYDCUJNXZS4LABSVJCUOBLVYAB/action/citation_signature","submit_replication":"https://pith.science/pith/OYDCUJNXZS4LABSVJCUOBLVYAB/action/replication_record"}},"created_at":"2026-05-18T00:38:32.336418+00:00","updated_at":"2026-05-18T00:38:32.336418+00:00"}