{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:JCZXQZBU53NGNXAVXMY6PZ7HXB","short_pith_number":"pith:JCZXQZBU","canonical_record":{"source":{"id":"1503.08191","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-03-27T19:22:06Z","cross_cats_sorted":[],"title_canon_sha256":"2c4be5f6a69b66edab8c6d465a63d6e8055ecad5e35487994f4f1c5f2f9f4e34","abstract_canon_sha256":"d63aea22b15ee176ffd445155864581c8fc983e30294702a9ecf6def937e3298"},"schema_version":"1.0"},"canonical_sha256":"48b3786434eeda66dc15bb31e7e7e7b86b471e10a90cbf6f7e1afc1f020af378","source":{"kind":"arxiv","id":"1503.08191","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1503.08191","created_at":"2026-05-18T01:36:33Z"},{"alias_kind":"arxiv_version","alias_value":"1503.08191v3","created_at":"2026-05-18T01:36:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1503.08191","created_at":"2026-05-18T01:36:33Z"},{"alias_kind":"pith_short_12","alias_value":"JCZXQZBU53NG","created_at":"2026-05-18T12:29:27Z"},{"alias_kind":"pith_short_16","alias_value":"JCZXQZBU53NGNXAV","created_at":"2026-05-18T12:29:27Z"},{"alias_kind":"pith_short_8","alias_value":"JCZXQZBU","created_at":"2026-05-18T12:29:27Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:JCZXQZBU53NGNXAVXMY6PZ7HXB","target":"record","payload":{"canonical_record":{"source":{"id":"1503.08191","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-03-27T19:22:06Z","cross_cats_sorted":[],"title_canon_sha256":"2c4be5f6a69b66edab8c6d465a63d6e8055ecad5e35487994f4f1c5f2f9f4e34","abstract_canon_sha256":"d63aea22b15ee176ffd445155864581c8fc983e30294702a9ecf6def937e3298"},"schema_version":"1.0"},"canonical_sha256":"48b3786434eeda66dc15bb31e7e7e7b86b471e10a90cbf6f7e1afc1f020af378","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:36:33.644438Z","signature_b64":"RyAwcI4xOLJ+GchSLM81IsrvEVxibFyzMnE3Gpo45xdcZjayVNzuv/pKP19GIg0tFBL0f0tHcfzLltEYX/4/Cg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"48b3786434eeda66dc15bb31e7e7e7b86b471e10a90cbf6f7e1afc1f020af378","last_reissued_at":"2026-05-18T01:36:33.644045Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:36:33.644045Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1503.08191","source_version":3,"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:36:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"a8DKKPiRjnIG7nWhg3LxMau9LzFDxQYbIa+mDemzojNeOHfCdCnMLxZDrw8/tJvi3yAOqbHkXsRFRm7VaxMQAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T05:21:52.991407Z"},"content_sha256":"ba2060ee69f07d96671e86433d00941ebdb5b9e64fffceb06064a675a93e72cc","schema_version":"1.0","event_id":"sha256:ba2060ee69f07d96671e86433d00941ebdb5b9e64fffceb06064a675a93e72cc"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:JCZXQZBU53NGNXAVXMY6PZ7HXB","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Fractional triangle decompositions in graphs with large minimum degree","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Fran\\c{c}ois Dross","submitted_at":"2015-03-27T19:22:06Z","abstract_excerpt":"A triangle decomposition of a graph is a partition of its edges into triangles. A fractional triangle decomposition of a graph is an assignment of a non-negative weight to each of its triangles such that the sum of the weights of the triangles containing any given edge is one. We prove that for all $\\epsilon > 0$, every large enough graph graph on $n$ vertices with minimum degree at least $(0.9 + \\epsilon)n$ has a fractional triangle decomposition. This improves a result of Garaschuk that the same result holds for graphs with minimum degree at least $0.956n$. Together with a recent result of B"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1503.08191","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"},"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:36:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Q6TsNHByjgvNx1OrDwoB2pkH8qmxPtEN3mYpS2R6ssElb1rJF8viNLZdraNQYnXYO7Gr4yyq7xgz1MnP9ivtDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T05:21:52.991755Z"},"content_sha256":"fe44755345b644ce1c5f0fdc646c977e08d0e52b387088ed376894b0786f6490","schema_version":"1.0","event_id":"sha256:fe44755345b644ce1c5f0fdc646c977e08d0e52b387088ed376894b0786f6490"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/JCZXQZBU53NGNXAVXMY6PZ7HXB/bundle.json","state_url":"https://pith.science/pith/JCZXQZBU53NGNXAVXMY6PZ7HXB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/JCZXQZBU53NGNXAVXMY6PZ7HXB/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-20T05:21:52Z","links":{"resolver":"https://pith.science/pith/JCZXQZBU53NGNXAVXMY6PZ7HXB","bundle":"https://pith.science/pith/JCZXQZBU53NGNXAVXMY6PZ7HXB/bundle.json","state":"https://pith.science/pith/JCZXQZBU53NGNXAVXMY6PZ7HXB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/JCZXQZBU53NGNXAVXMY6PZ7HXB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:JCZXQZBU53NGNXAVXMY6PZ7HXB","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":"d63aea22b15ee176ffd445155864581c8fc983e30294702a9ecf6def937e3298","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-03-27T19:22:06Z","title_canon_sha256":"2c4be5f6a69b66edab8c6d465a63d6e8055ecad5e35487994f4f1c5f2f9f4e34"},"schema_version":"1.0","source":{"id":"1503.08191","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1503.08191","created_at":"2026-05-18T01:36:33Z"},{"alias_kind":"arxiv_version","alias_value":"1503.08191v3","created_at":"2026-05-18T01:36:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1503.08191","created_at":"2026-05-18T01:36:33Z"},{"alias_kind":"pith_short_12","alias_value":"JCZXQZBU53NG","created_at":"2026-05-18T12:29:27Z"},{"alias_kind":"pith_short_16","alias_value":"JCZXQZBU53NGNXAV","created_at":"2026-05-18T12:29:27Z"},{"alias_kind":"pith_short_8","alias_value":"JCZXQZBU","created_at":"2026-05-18T12:29:27Z"}],"graph_snapshots":[{"event_id":"sha256:fe44755345b644ce1c5f0fdc646c977e08d0e52b387088ed376894b0786f6490","target":"graph","created_at":"2026-05-18T01:36:33Z","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":"A triangle decomposition of a graph is a partition of its edges into triangles. A fractional triangle decomposition of a graph is an assignment of a non-negative weight to each of its triangles such that the sum of the weights of the triangles containing any given edge is one. We prove that for all $\\epsilon > 0$, every large enough graph graph on $n$ vertices with minimum degree at least $(0.9 + \\epsilon)n$ has a fractional triangle decomposition. This improves a result of Garaschuk that the same result holds for graphs with minimum degree at least $0.956n$. Together with a recent result of B","authors_text":"Fran\\c{c}ois Dross","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-03-27T19:22:06Z","title":"Fractional triangle decompositions in graphs with large minimum degree"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1503.08191","kind":"arxiv","version":3},"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:ba2060ee69f07d96671e86433d00941ebdb5b9e64fffceb06064a675a93e72cc","target":"record","created_at":"2026-05-18T01:36:33Z","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":"d63aea22b15ee176ffd445155864581c8fc983e30294702a9ecf6def937e3298","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-03-27T19:22:06Z","title_canon_sha256":"2c4be5f6a69b66edab8c6d465a63d6e8055ecad5e35487994f4f1c5f2f9f4e34"},"schema_version":"1.0","source":{"id":"1503.08191","kind":"arxiv","version":3}},"canonical_sha256":"48b3786434eeda66dc15bb31e7e7e7b86b471e10a90cbf6f7e1afc1f020af378","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"48b3786434eeda66dc15bb31e7e7e7b86b471e10a90cbf6f7e1afc1f020af378","first_computed_at":"2026-05-18T01:36:33.644045Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:36:33.644045Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"RyAwcI4xOLJ+GchSLM81IsrvEVxibFyzMnE3Gpo45xdcZjayVNzuv/pKP19GIg0tFBL0f0tHcfzLltEYX/4/Cg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:36:33.644438Z","signed_message":"canonical_sha256_bytes"},"source_id":"1503.08191","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ba2060ee69f07d96671e86433d00941ebdb5b9e64fffceb06064a675a93e72cc","sha256:fe44755345b644ce1c5f0fdc646c977e08d0e52b387088ed376894b0786f6490"],"state_sha256":"83ab1ee33546e05d48c0331758b2acb0e2b8898250895df2bd5caacfce9b5c82"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"grywfpeqHLMz2LHjoe9ye/m0KqkRUi/VR0BumV59awuyd4fT5p24OFW6ypMuDXWCGMklL6uHXBEELTJTamuGDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-20T05:21:52.993609Z","bundle_sha256":"6b91d0066418bceba2d9de804c40c503f1fdd26bac0b6c8766934583660a4fa2"}}