{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:I3WZVOAVVURB6T6GJHVHBVSVF2","short_pith_number":"pith:I3WZVOAV","schema_version":"1.0","canonical_sha256":"46ed9ab815ad221f4fc649ea70d6552e971a95278c78ce15970c5d4fb0b1e696","source":{"kind":"arxiv","id":"1607.07204","version":2},"attestation_state":"computed","paper":{"title":"An algorithmic regularity lemma for $L_p$ regular sparse matrices","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Silouanos Brazitikos, Thodoris Karageorgos","submitted_at":"2016-07-25T11:08:05Z","abstract_excerpt":"We prove an algorithmic regularity lemma for $L_p$ regular matrices $(1 < p \\leq \\infty),$ a class of sparse $\\{0,1\\}$ matrices which obey a natural pseudorandomness condition. This extends a result of Coja-Oghlan, Cooper and Frieze who treated the case of $L_{\\infty}$ regular matrices. We also present applications of this result for tensors and MAX-CSP instances."},"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":"1607.07204","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-07-25T11:08:05Z","cross_cats_sorted":[],"title_canon_sha256":"122a7955d7db3ed8c38a5468441695659e27fe57ed3a9d407051a0e24d09d411","abstract_canon_sha256":"73b8e9239e6469cdc5a681d5e23373bc641db349fbf97ccbb130537eb1646584"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:44:16.004419Z","signature_b64":"Ylv4UTwDQYBhfa0+bNWTK4E8Ycg4R+dkWkCy7vCGO/jdJWBUfjcNwbBTWSL6FEqPOzbcSmKqenYEd1HvhU2UCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"46ed9ab815ad221f4fc649ea70d6552e971a95278c78ce15970c5d4fb0b1e696","last_reissued_at":"2026-05-18T00:44:16.003860Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:44:16.003860Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"An algorithmic regularity lemma for $L_p$ regular sparse matrices","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Silouanos Brazitikos, Thodoris Karageorgos","submitted_at":"2016-07-25T11:08:05Z","abstract_excerpt":"We prove an algorithmic regularity lemma for $L_p$ regular matrices $(1 < p \\leq \\infty),$ a class of sparse $\\{0,1\\}$ matrices which obey a natural pseudorandomness condition. This extends a result of Coja-Oghlan, Cooper and Frieze who treated the case of $L_{\\infty}$ regular matrices. We also present applications of this result for tensors and MAX-CSP instances."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1607.07204","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":"1607.07204","created_at":"2026-05-18T00:44:16.003940+00:00"},{"alias_kind":"arxiv_version","alias_value":"1607.07204v2","created_at":"2026-05-18T00:44:16.003940+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.07204","created_at":"2026-05-18T00:44:16.003940+00:00"},{"alias_kind":"pith_short_12","alias_value":"I3WZVOAVVURB","created_at":"2026-05-18T12:30:22.444734+00:00"},{"alias_kind":"pith_short_16","alias_value":"I3WZVOAVVURB6T6G","created_at":"2026-05-18T12:30:22.444734+00:00"},{"alias_kind":"pith_short_8","alias_value":"I3WZVOAV","created_at":"2026-05-18T12:30:22.444734+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/I3WZVOAVVURB6T6GJHVHBVSVF2","json":"https://pith.science/pith/I3WZVOAVVURB6T6GJHVHBVSVF2.json","graph_json":"https://pith.science/api/pith-number/I3WZVOAVVURB6T6GJHVHBVSVF2/graph.json","events_json":"https://pith.science/api/pith-number/I3WZVOAVVURB6T6GJHVHBVSVF2/events.json","paper":"https://pith.science/paper/I3WZVOAV"},"agent_actions":{"view_html":"https://pith.science/pith/I3WZVOAVVURB6T6GJHVHBVSVF2","download_json":"https://pith.science/pith/I3WZVOAVVURB6T6GJHVHBVSVF2.json","view_paper":"https://pith.science/paper/I3WZVOAV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1607.07204&json=true","fetch_graph":"https://pith.science/api/pith-number/I3WZVOAVVURB6T6GJHVHBVSVF2/graph.json","fetch_events":"https://pith.science/api/pith-number/I3WZVOAVVURB6T6GJHVHBVSVF2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/I3WZVOAVVURB6T6GJHVHBVSVF2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/I3WZVOAVVURB6T6GJHVHBVSVF2/action/storage_attestation","attest_author":"https://pith.science/pith/I3WZVOAVVURB6T6GJHVHBVSVF2/action/author_attestation","sign_citation":"https://pith.science/pith/I3WZVOAVVURB6T6GJHVHBVSVF2/action/citation_signature","submit_replication":"https://pith.science/pith/I3WZVOAVVURB6T6GJHVHBVSVF2/action/replication_record"}},"created_at":"2026-05-18T00:44:16.003940+00:00","updated_at":"2026-05-18T00:44:16.003940+00:00"}