{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:UC34ZYXRAZFKKRI4AKRTLVY3O4","short_pith_number":"pith:UC34ZYXR","schema_version":"1.0","canonical_sha256":"a0b7cce2f1064aa5451c02a335d71b771d2a9684453a0d6dfbf1e9145364f8cc","source":{"kind":"arxiv","id":"1108.1576","version":3},"attestation_state":"computed","paper":{"title":"Fractional edge-decompositions of dense graphs and related eigenvalues","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Peter J. Dukes","submitted_at":"2011-08-07T21:22:11Z","abstract_excerpt":"We consider the problem of decomposing some $t$-uniform hypergraph $G$ into copies of another, say $H$, with nonnegative rational weights. For fixed $H$ on $k$ vertices, we show that this is always possible for all $G$ having sufficiently many vertices and `local density' at least $1-C(t)k^{-2t}$. In the case $t=2$ and $H=K_3$, we show that all large graphs with density at least $27/28$ admit a fractional triangle decomposition. The proof relies on estimates of certain eigenvalues in the Johnson scheme."},"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":"1108.1576","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-08-07T21:22:11Z","cross_cats_sorted":[],"title_canon_sha256":"9974d2bb07de611db44e0d8c7172c92777fd763275516895b400a51ebd31174f","abstract_canon_sha256":"cc142f969444a126d98657f203ba72587888483f73c41dae95556309b6c50323"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:35:52.873662Z","signature_b64":"wH7P+HqY7J06FXhVQH8EcZAcJwmmFv4Z+nbLOumDP56dLh5fY30WSQZdvY8q1s/U/jDf8TKoXN0UwfvI/1WUBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a0b7cce2f1064aa5451c02a335d71b771d2a9684453a0d6dfbf1e9145364f8cc","last_reissued_at":"2026-05-18T02:35:52.873121Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:35:52.873121Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Fractional edge-decompositions of dense graphs and related eigenvalues","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Peter J. Dukes","submitted_at":"2011-08-07T21:22:11Z","abstract_excerpt":"We consider the problem of decomposing some $t$-uniform hypergraph $G$ into copies of another, say $H$, with nonnegative rational weights. For fixed $H$ on $k$ vertices, we show that this is always possible for all $G$ having sufficiently many vertices and `local density' at least $1-C(t)k^{-2t}$. In the case $t=2$ and $H=K_3$, we show that all large graphs with density at least $27/28$ admit a fractional triangle decomposition. The proof relies on estimates of certain eigenvalues in the Johnson scheme."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1108.1576","kind":"arxiv","version":3},"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":"1108.1576","created_at":"2026-05-18T02:35:52.873212+00:00"},{"alias_kind":"arxiv_version","alias_value":"1108.1576v3","created_at":"2026-05-18T02:35:52.873212+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1108.1576","created_at":"2026-05-18T02:35:52.873212+00:00"},{"alias_kind":"pith_short_12","alias_value":"UC34ZYXRAZFK","created_at":"2026-05-18T12:26:42.757692+00:00"},{"alias_kind":"pith_short_16","alias_value":"UC34ZYXRAZFKKRI4","created_at":"2026-05-18T12:26:42.757692+00:00"},{"alias_kind":"pith_short_8","alias_value":"UC34ZYXR","created_at":"2026-05-18T12:26:42.757692+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/UC34ZYXRAZFKKRI4AKRTLVY3O4","json":"https://pith.science/pith/UC34ZYXRAZFKKRI4AKRTLVY3O4.json","graph_json":"https://pith.science/api/pith-number/UC34ZYXRAZFKKRI4AKRTLVY3O4/graph.json","events_json":"https://pith.science/api/pith-number/UC34ZYXRAZFKKRI4AKRTLVY3O4/events.json","paper":"https://pith.science/paper/UC34ZYXR"},"agent_actions":{"view_html":"https://pith.science/pith/UC34ZYXRAZFKKRI4AKRTLVY3O4","download_json":"https://pith.science/pith/UC34ZYXRAZFKKRI4AKRTLVY3O4.json","view_paper":"https://pith.science/paper/UC34ZYXR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1108.1576&json=true","fetch_graph":"https://pith.science/api/pith-number/UC34ZYXRAZFKKRI4AKRTLVY3O4/graph.json","fetch_events":"https://pith.science/api/pith-number/UC34ZYXRAZFKKRI4AKRTLVY3O4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UC34ZYXRAZFKKRI4AKRTLVY3O4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UC34ZYXRAZFKKRI4AKRTLVY3O4/action/storage_attestation","attest_author":"https://pith.science/pith/UC34ZYXRAZFKKRI4AKRTLVY3O4/action/author_attestation","sign_citation":"https://pith.science/pith/UC34ZYXRAZFKKRI4AKRTLVY3O4/action/citation_signature","submit_replication":"https://pith.science/pith/UC34ZYXRAZFKKRI4AKRTLVY3O4/action/replication_record"}},"created_at":"2026-05-18T02:35:52.873212+00:00","updated_at":"2026-05-18T02:35:52.873212+00:00"}