{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:UJ5R6Z6A4JRHNMQ7B47JACZLPC","short_pith_number":"pith:UJ5R6Z6A","canonical_record":{"source":{"id":"1309.7440","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-09-28T08:08:51Z","cross_cats_sorted":["cs.SI","math.CO"],"title_canon_sha256":"d1abddee7494afeaa1c1de192099790c09d56027589a2bdfe4704090b56f43a4","abstract_canon_sha256":"826dd234122f8f66e91b3767f81b998aca0eeda2c1c3287e2bfe1619e7206045"},"schema_version":"1.0"},"canonical_sha256":"a27b1f67c0e26276b21f0f3e900b2b7892bd7551cf877b82da47b363a9d65083","source":{"kind":"arxiv","id":"1309.7440","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1309.7440","created_at":"2026-05-18T02:59:47Z"},{"alias_kind":"arxiv_version","alias_value":"1309.7440v3","created_at":"2026-05-18T02:59:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1309.7440","created_at":"2026-05-18T02:59:47Z"},{"alias_kind":"pith_short_12","alias_value":"UJ5R6Z6A4JRH","created_at":"2026-05-18T12:28:02Z"},{"alias_kind":"pith_short_16","alias_value":"UJ5R6Z6A4JRHNMQ7","created_at":"2026-05-18T12:28:02Z"},{"alias_kind":"pith_short_8","alias_value":"UJ5R6Z6A","created_at":"2026-05-18T12:28:02Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:UJ5R6Z6A4JRHNMQ7B47JACZLPC","target":"record","payload":{"canonical_record":{"source":{"id":"1309.7440","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-09-28T08:08:51Z","cross_cats_sorted":["cs.SI","math.CO"],"title_canon_sha256":"d1abddee7494afeaa1c1de192099790c09d56027589a2bdfe4704090b56f43a4","abstract_canon_sha256":"826dd234122f8f66e91b3767f81b998aca0eeda2c1c3287e2bfe1619e7206045"},"schema_version":"1.0"},"canonical_sha256":"a27b1f67c0e26276b21f0f3e900b2b7892bd7551cf877b82da47b363a9d65083","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:59:47.627763Z","signature_b64":"ShSlIjry/bk66p8P0scKotn1gJ/Gx3TVcSw5MKDTPDP7eUILk1wQ+djhVxfEBoV8gNu+GcIe57XCQhHANUwqBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a27b1f67c0e26276b21f0f3e900b2b7892bd7551cf877b82da47b363a9d65083","last_reissued_at":"2026-05-18T02:59:47.627050Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:59:47.627050Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1309.7440","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-18T02:59:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kCQjEkc3Qr8xsCE/cjr/c0Op6rqoQzxl/M0jVbwcUWrbcaHEOsfrCGNPHILLC/dh4NR7AuOiSFdsxU3OefdjAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T18:57:43.138993Z"},"content_sha256":"c0cc7ade9d0ca21ad4c59a3311ae3c059a6181fbf8636601fcd736610861546d","schema_version":"1.0","event_id":"sha256:c0cc7ade9d0ca21ad4c59a3311ae3c059a6181fbf8636601fcd736610861546d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:UJ5R6Z6A4JRHNMQ7B47JACZLPC","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Decompositions of Triangle-Dense Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SI","math.CO"],"primary_cat":"cs.DS","authors_text":"C. Seshadhri, Rishi Gupta, Tim Roughgarden","submitted_at":"2013-09-28T08:08:51Z","abstract_excerpt":"High triangle density -- the graph property stating that a constant fraction of two-hop paths belong to a triangle -- is a common signature of social networks. This paper studies triangle-dense graphs from a structural perspective. We prove constructively that significant portions of a triangle-dense graph are contained in a disjoint union of dense, radius 2 subgraphs. This result quantifies the extent to which triangle-dense graphs resemble unions of cliques. We also show that our algorithm recovers planted clusterings in approximation-stable k-median instances."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1309.7440","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-18T02:59:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ASr6RhwCE2X50GFFkK0/0BDUVb7JQNBKb5jwAso3JkJBeoVSUn6vnG5BM1V4ZGs8gbc/Znb/MRGdPWAg6Xj7Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T18:57:43.139352Z"},"content_sha256":"94bdac9b270ef2f7a3efda882cac167630a5d296b43ce36512e06d801465646c","schema_version":"1.0","event_id":"sha256:94bdac9b270ef2f7a3efda882cac167630a5d296b43ce36512e06d801465646c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/UJ5R6Z6A4JRHNMQ7B47JACZLPC/bundle.json","state_url":"https://pith.science/pith/UJ5R6Z6A4JRHNMQ7B47JACZLPC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/UJ5R6Z6A4JRHNMQ7B47JACZLPC/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-24T18:57:43Z","links":{"resolver":"https://pith.science/pith/UJ5R6Z6A4JRHNMQ7B47JACZLPC","bundle":"https://pith.science/pith/UJ5R6Z6A4JRHNMQ7B47JACZLPC/bundle.json","state":"https://pith.science/pith/UJ5R6Z6A4JRHNMQ7B47JACZLPC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/UJ5R6Z6A4JRHNMQ7B47JACZLPC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:UJ5R6Z6A4JRHNMQ7B47JACZLPC","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":"826dd234122f8f66e91b3767f81b998aca0eeda2c1c3287e2bfe1619e7206045","cross_cats_sorted":["cs.SI","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-09-28T08:08:51Z","title_canon_sha256":"d1abddee7494afeaa1c1de192099790c09d56027589a2bdfe4704090b56f43a4"},"schema_version":"1.0","source":{"id":"1309.7440","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1309.7440","created_at":"2026-05-18T02:59:47Z"},{"alias_kind":"arxiv_version","alias_value":"1309.7440v3","created_at":"2026-05-18T02:59:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1309.7440","created_at":"2026-05-18T02:59:47Z"},{"alias_kind":"pith_short_12","alias_value":"UJ5R6Z6A4JRH","created_at":"2026-05-18T12:28:02Z"},{"alias_kind":"pith_short_16","alias_value":"UJ5R6Z6A4JRHNMQ7","created_at":"2026-05-18T12:28:02Z"},{"alias_kind":"pith_short_8","alias_value":"UJ5R6Z6A","created_at":"2026-05-18T12:28:02Z"}],"graph_snapshots":[{"event_id":"sha256:94bdac9b270ef2f7a3efda882cac167630a5d296b43ce36512e06d801465646c","target":"graph","created_at":"2026-05-18T02:59:47Z","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":"High triangle density -- the graph property stating that a constant fraction of two-hop paths belong to a triangle -- is a common signature of social networks. This paper studies triangle-dense graphs from a structural perspective. We prove constructively that significant portions of a triangle-dense graph are contained in a disjoint union of dense, radius 2 subgraphs. This result quantifies the extent to which triangle-dense graphs resemble unions of cliques. We also show that our algorithm recovers planted clusterings in approximation-stable k-median instances.","authors_text":"C. Seshadhri, Rishi Gupta, Tim Roughgarden","cross_cats":["cs.SI","math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-09-28T08:08:51Z","title":"Decompositions of Triangle-Dense Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1309.7440","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:c0cc7ade9d0ca21ad4c59a3311ae3c059a6181fbf8636601fcd736610861546d","target":"record","created_at":"2026-05-18T02:59:47Z","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":"826dd234122f8f66e91b3767f81b998aca0eeda2c1c3287e2bfe1619e7206045","cross_cats_sorted":["cs.SI","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-09-28T08:08:51Z","title_canon_sha256":"d1abddee7494afeaa1c1de192099790c09d56027589a2bdfe4704090b56f43a4"},"schema_version":"1.0","source":{"id":"1309.7440","kind":"arxiv","version":3}},"canonical_sha256":"a27b1f67c0e26276b21f0f3e900b2b7892bd7551cf877b82da47b363a9d65083","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a27b1f67c0e26276b21f0f3e900b2b7892bd7551cf877b82da47b363a9d65083","first_computed_at":"2026-05-18T02:59:47.627050Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:59:47.627050Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ShSlIjry/bk66p8P0scKotn1gJ/Gx3TVcSw5MKDTPDP7eUILk1wQ+djhVxfEBoV8gNu+GcIe57XCQhHANUwqBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:59:47.627763Z","signed_message":"canonical_sha256_bytes"},"source_id":"1309.7440","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c0cc7ade9d0ca21ad4c59a3311ae3c059a6181fbf8636601fcd736610861546d","sha256:94bdac9b270ef2f7a3efda882cac167630a5d296b43ce36512e06d801465646c"],"state_sha256":"b39602e21f4cd3641d8f3aaaa29098570ea250152d2b570e3a7182f74a94fe7f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IP5rkd2uZs+yBqjNiQQ/5MD0f3uDzt0n3M6s1OQsnt0BTNin0wd2WdZwlgYXsopJ0rCMCNfPBUztw2b2NHccDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-24T18:57:43.141282Z","bundle_sha256":"8a4bbb1bd4b0f9338ef7092db99917fe4edc2e9881b247bfcf5f8cfddc5a6e9a"}}