{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:SBOPALI4WGERJKMRCPENEXUCTT","short_pith_number":"pith:SBOPALI4","schema_version":"1.0","canonical_sha256":"905cf02d1cb18914a99113c8d25e829cdb2437e0ffbca5604aa6c124e8682ea0","source":{"kind":"arxiv","id":"1310.5256","version":3},"attestation_state":"computed","paper":{"title":"On a conjecture on sparse binomial-type polynomials by Brown, Dilcher and Manna","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CA","authors_text":"Thorsten Neuschel, Wolfgang Gawronski","submitted_at":"2013-10-19T17:56:48Z","abstract_excerpt":"We prove a conjecture by Brown, Dilcher and Manna on the asymptotic behavior of sparse binomial-type polynomials arising naturally in a graph theoretical context in connection with the expected number of independent sets of a graph."},"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":"1310.5256","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CA","submitted_at":"2013-10-19T17:56:48Z","cross_cats_sorted":[],"title_canon_sha256":"e0705806701ac8cc2ffd0b6e2bf7a2c1014623a0a6e7828bbff1ea511e6f24b9","abstract_canon_sha256":"cb19888399acf12aae13affbce08a991e890c2cb6e466ba5d7d789ae46b64624"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:57:43.430348Z","signature_b64":"eV5vcwpafJZ09nj4Czbu55jV+T72Wixqn14bsDyGGslNbat3Nz1CmfNGnsSVd/hNc2NoG/dKkRtq6IxAgkOjBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"905cf02d1cb18914a99113c8d25e829cdb2437e0ffbca5604aa6c124e8682ea0","last_reissued_at":"2026-05-18T02:57:43.429720Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:57:43.429720Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On a conjecture on sparse binomial-type polynomials by Brown, Dilcher and Manna","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CA","authors_text":"Thorsten Neuschel, Wolfgang Gawronski","submitted_at":"2013-10-19T17:56:48Z","abstract_excerpt":"We prove a conjecture by Brown, Dilcher and Manna on the asymptotic behavior of sparse binomial-type polynomials arising naturally in a graph theoretical context in connection with the expected number of independent sets of a graph."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1310.5256","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":"1310.5256","created_at":"2026-05-18T02:57:43.429825+00:00"},{"alias_kind":"arxiv_version","alias_value":"1310.5256v3","created_at":"2026-05-18T02:57:43.429825+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1310.5256","created_at":"2026-05-18T02:57:43.429825+00:00"},{"alias_kind":"pith_short_12","alias_value":"SBOPALI4WGER","created_at":"2026-05-18T12:27:59.945178+00:00"},{"alias_kind":"pith_short_16","alias_value":"SBOPALI4WGERJKMR","created_at":"2026-05-18T12:27:59.945178+00:00"},{"alias_kind":"pith_short_8","alias_value":"SBOPALI4","created_at":"2026-05-18T12:27:59.945178+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/SBOPALI4WGERJKMRCPENEXUCTT","json":"https://pith.science/pith/SBOPALI4WGERJKMRCPENEXUCTT.json","graph_json":"https://pith.science/api/pith-number/SBOPALI4WGERJKMRCPENEXUCTT/graph.json","events_json":"https://pith.science/api/pith-number/SBOPALI4WGERJKMRCPENEXUCTT/events.json","paper":"https://pith.science/paper/SBOPALI4"},"agent_actions":{"view_html":"https://pith.science/pith/SBOPALI4WGERJKMRCPENEXUCTT","download_json":"https://pith.science/pith/SBOPALI4WGERJKMRCPENEXUCTT.json","view_paper":"https://pith.science/paper/SBOPALI4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1310.5256&json=true","fetch_graph":"https://pith.science/api/pith-number/SBOPALI4WGERJKMRCPENEXUCTT/graph.json","fetch_events":"https://pith.science/api/pith-number/SBOPALI4WGERJKMRCPENEXUCTT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SBOPALI4WGERJKMRCPENEXUCTT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SBOPALI4WGERJKMRCPENEXUCTT/action/storage_attestation","attest_author":"https://pith.science/pith/SBOPALI4WGERJKMRCPENEXUCTT/action/author_attestation","sign_citation":"https://pith.science/pith/SBOPALI4WGERJKMRCPENEXUCTT/action/citation_signature","submit_replication":"https://pith.science/pith/SBOPALI4WGERJKMRCPENEXUCTT/action/replication_record"}},"created_at":"2026-05-18T02:57:43.429825+00:00","updated_at":"2026-05-18T02:57:43.429825+00:00"}