{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:S3YG2QFBJKDTCYKKM35QKP7OTN","short_pith_number":"pith:S3YG2QFB","schema_version":"1.0","canonical_sha256":"96f06d40a14a8731614a66fb053fee9b7247ee12e11108d6df83db436d97026d","source":{"kind":"arxiv","id":"1607.04741","version":1},"attestation_state":"computed","paper":{"title":"Flag Algebras: A First Glance","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"math.CO","authors_text":"Cristiane Maria Sato, Fernando M\\'ario de Oliveira Filho, Marcel K. de Carli Silva","submitted_at":"2016-07-16T13:37:54Z","abstract_excerpt":"The theory of flag algebras, introduced by Razborov in 2007, has opened the way to a systematic approach to the development of computer-assisted proofs in extremal combinatorics. It makes it possible to derive bounds for parameters in extremal combinatorics with the help of a computer, in a semi-automated manner. This article describes the main points of the theory in a complete way, using Mantel's theorem as a guiding example."},"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.04741","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-07-16T13:37:54Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"606d7344d19699e3beabe8664ba6336952f1b3b367f7f5298739b3ed59ee9346","abstract_canon_sha256":"682062ce533bf4affe2ca2c2398a52289cd31fda451bd6a6b4a8f3d80db292ea"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:10:56.835360Z","signature_b64":"YtlcTiqixufR1XkdV2T43zfx8uDGjTheaYx3hYffJr5XBRiE4T4MWQ+947jIUEaRUCw3KXMKgCJhIW+xp6ujCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"96f06d40a14a8731614a66fb053fee9b7247ee12e11108d6df83db436d97026d","last_reissued_at":"2026-05-18T01:10:56.834880Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:10:56.834880Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Flag Algebras: A First Glance","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"math.CO","authors_text":"Cristiane Maria Sato, Fernando M\\'ario de Oliveira Filho, Marcel K. de Carli Silva","submitted_at":"2016-07-16T13:37:54Z","abstract_excerpt":"The theory of flag algebras, introduced by Razborov in 2007, has opened the way to a systematic approach to the development of computer-assisted proofs in extremal combinatorics. It makes it possible to derive bounds for parameters in extremal combinatorics with the help of a computer, in a semi-automated manner. This article describes the main points of the theory in a complete way, using Mantel's theorem as a guiding example."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1607.04741","kind":"arxiv","version":1},"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.04741","created_at":"2026-05-18T01:10:56.834944+00:00"},{"alias_kind":"arxiv_version","alias_value":"1607.04741v1","created_at":"2026-05-18T01:10:56.834944+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.04741","created_at":"2026-05-18T01:10:56.834944+00:00"},{"alias_kind":"pith_short_12","alias_value":"S3YG2QFBJKDT","created_at":"2026-05-18T12:30:41.710351+00:00"},{"alias_kind":"pith_short_16","alias_value":"S3YG2QFBJKDTCYKK","created_at":"2026-05-18T12:30:41.710351+00:00"},{"alias_kind":"pith_short_8","alias_value":"S3YG2QFB","created_at":"2026-05-18T12:30:41.710351+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.05346","citing_title":"Balanced bipartite distance of $K_4$-free graphs","ref_index":30,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/S3YG2QFBJKDTCYKKM35QKP7OTN","json":"https://pith.science/pith/S3YG2QFBJKDTCYKKM35QKP7OTN.json","graph_json":"https://pith.science/api/pith-number/S3YG2QFBJKDTCYKKM35QKP7OTN/graph.json","events_json":"https://pith.science/api/pith-number/S3YG2QFBJKDTCYKKM35QKP7OTN/events.json","paper":"https://pith.science/paper/S3YG2QFB"},"agent_actions":{"view_html":"https://pith.science/pith/S3YG2QFBJKDTCYKKM35QKP7OTN","download_json":"https://pith.science/pith/S3YG2QFBJKDTCYKKM35QKP7OTN.json","view_paper":"https://pith.science/paper/S3YG2QFB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1607.04741&json=true","fetch_graph":"https://pith.science/api/pith-number/S3YG2QFBJKDTCYKKM35QKP7OTN/graph.json","fetch_events":"https://pith.science/api/pith-number/S3YG2QFBJKDTCYKKM35QKP7OTN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/S3YG2QFBJKDTCYKKM35QKP7OTN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/S3YG2QFBJKDTCYKKM35QKP7OTN/action/storage_attestation","attest_author":"https://pith.science/pith/S3YG2QFBJKDTCYKKM35QKP7OTN/action/author_attestation","sign_citation":"https://pith.science/pith/S3YG2QFBJKDTCYKKM35QKP7OTN/action/citation_signature","submit_replication":"https://pith.science/pith/S3YG2QFBJKDTCYKKM35QKP7OTN/action/replication_record"}},"created_at":"2026-05-18T01:10:56.834944+00:00","updated_at":"2026-05-18T01:10:56.834944+00:00"}