{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:XVLRR4LKKTBASE4VFIXLXWDXYH","short_pith_number":"pith:XVLRR4LK","schema_version":"1.0","canonical_sha256":"bd5718f16a54c20913952a2ebbd877c1f0e638ceadc6ebd9f8ecfaa7925a7fd0","source":{"kind":"arxiv","id":"1401.6681","version":2},"attestation_state":"computed","paper":{"title":"On giant components and treewidth in the layers model","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"Daniel Reichman, Jonathan Hermon, Uriel Feige","submitted_at":"2014-01-26T19:38:38Z","abstract_excerpt":"Given an undirected $n$-vertex graph $G(V,E)$ and an integer $k$, let $T_k(G)$ denote the random vertex induced subgraph of $G$ generated by ordering $V$ according to a random permutation $\\pi$ and including in $T_k(G)$ those vertices with at most $k-1$ of their neighbors preceding them in this order. The distribution of subgraphs sampled in this manner is called the \\emph{layers model with parameter} $k$. The layers model has found applications in studying $\\ell$-degenerate subgraphs, the design of algorithms for the maximum independent set problem, and in bootstrap percolation.\n  In the curr"},"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":"1401.6681","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2014-01-26T19:38:38Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"915475ba01177cb53a3f47da9ce22280f0f526e886d67402ce14944a42fe9672","abstract_canon_sha256":"3a8a7d0458da7cc358d06392fdea2e0f384ed99097db5d24f96fd44ddeaa9273"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:25:06.073231Z","signature_b64":"Bn0Ocu9Tf/1XIC5PRkJrB8qAEGypymk+riqRzhE29cKpR023y1zC4rXUDKoUjapSFS1zM/jNNu8Xpcp/douWBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bd5718f16a54c20913952a2ebbd877c1f0e638ceadc6ebd9f8ecfaa7925a7fd0","last_reissued_at":"2026-05-18T00:25:06.072871Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:25:06.072871Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On giant components and treewidth in the layers model","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"Daniel Reichman, Jonathan Hermon, Uriel Feige","submitted_at":"2014-01-26T19:38:38Z","abstract_excerpt":"Given an undirected $n$-vertex graph $G(V,E)$ and an integer $k$, let $T_k(G)$ denote the random vertex induced subgraph of $G$ generated by ordering $V$ according to a random permutation $\\pi$ and including in $T_k(G)$ those vertices with at most $k-1$ of their neighbors preceding them in this order. The distribution of subgraphs sampled in this manner is called the \\emph{layers model with parameter} $k$. The layers model has found applications in studying $\\ell$-degenerate subgraphs, the design of algorithms for the maximum independent set problem, and in bootstrap percolation.\n  In the curr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.6681","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":"1401.6681","created_at":"2026-05-18T00:25:06.072925+00:00"},{"alias_kind":"arxiv_version","alias_value":"1401.6681v2","created_at":"2026-05-18T00:25:06.072925+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.6681","created_at":"2026-05-18T00:25:06.072925+00:00"},{"alias_kind":"pith_short_12","alias_value":"XVLRR4LKKTBA","created_at":"2026-05-18T12:28:57.508820+00:00"},{"alias_kind":"pith_short_16","alias_value":"XVLRR4LKKTBASE4V","created_at":"2026-05-18T12:28:57.508820+00:00"},{"alias_kind":"pith_short_8","alias_value":"XVLRR4LK","created_at":"2026-05-18T12:28:57.508820+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/XVLRR4LKKTBASE4VFIXLXWDXYH","json":"https://pith.science/pith/XVLRR4LKKTBASE4VFIXLXWDXYH.json","graph_json":"https://pith.science/api/pith-number/XVLRR4LKKTBASE4VFIXLXWDXYH/graph.json","events_json":"https://pith.science/api/pith-number/XVLRR4LKKTBASE4VFIXLXWDXYH/events.json","paper":"https://pith.science/paper/XVLRR4LK"},"agent_actions":{"view_html":"https://pith.science/pith/XVLRR4LKKTBASE4VFIXLXWDXYH","download_json":"https://pith.science/pith/XVLRR4LKKTBASE4VFIXLXWDXYH.json","view_paper":"https://pith.science/paper/XVLRR4LK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1401.6681&json=true","fetch_graph":"https://pith.science/api/pith-number/XVLRR4LKKTBASE4VFIXLXWDXYH/graph.json","fetch_events":"https://pith.science/api/pith-number/XVLRR4LKKTBASE4VFIXLXWDXYH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XVLRR4LKKTBASE4VFIXLXWDXYH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XVLRR4LKKTBASE4VFIXLXWDXYH/action/storage_attestation","attest_author":"https://pith.science/pith/XVLRR4LKKTBASE4VFIXLXWDXYH/action/author_attestation","sign_citation":"https://pith.science/pith/XVLRR4LKKTBASE4VFIXLXWDXYH/action/citation_signature","submit_replication":"https://pith.science/pith/XVLRR4LKKTBASE4VFIXLXWDXYH/action/replication_record"}},"created_at":"2026-05-18T00:25:06.072925+00:00","updated_at":"2026-05-18T00:25:06.072925+00:00"}