{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2009:SMYJT4VQ2WFYYQE757WFGJQGM6","short_pith_number":"pith:SMYJT4VQ","schema_version":"1.0","canonical_sha256":"933099f2b0d58b8c409fefec53260667957d44b2864dde129aad26fd4cde949d","source":{"kind":"arxiv","id":"0902.4517","version":3},"attestation_state":"computed","paper":{"title":"On some class of reductions for Itoh-Narita-Bogoyavlenskii lattice","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"nlin.SI","authors_text":"Andrei K. Svinin","submitted_at":"2009-02-26T06:38:35Z","abstract_excerpt":"We show a broad class of constraints compatible with Itoh-Narita-Bogoyavlenskii lattice hierarchy. All these constraints can be written in the form of discrete conservation law $I_{i+1}=I_i$ with appropriate homogeneous polynomial discrete function $I=I[a]$."},"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":"0902.4517","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"nlin.SI","submitted_at":"2009-02-26T06:38:35Z","cross_cats_sorted":[],"title_canon_sha256":"d2e6a9491abff0844d9386ef5336327feef0e25a31c276dcac3132ec22fb7c97","abstract_canon_sha256":"fa00b915ee23db372a6a425bb5e693b407623a827770a8cc0f7bef554f5f0afa"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:14:38.773101Z","signature_b64":"r8LEY1f3FU41JMPXxnwrAUAYY123IOfsBwJVq5WX3dg42JmZCLRdNrQxRQR6PS8xLxCLnv7lMzdJq0cwCvfpBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"933099f2b0d58b8c409fefec53260667957d44b2864dde129aad26fd4cde949d","last_reissued_at":"2026-05-18T02:14:38.772433Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:14:38.772433Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On some class of reductions for Itoh-Narita-Bogoyavlenskii lattice","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"nlin.SI","authors_text":"Andrei K. Svinin","submitted_at":"2009-02-26T06:38:35Z","abstract_excerpt":"We show a broad class of constraints compatible with Itoh-Narita-Bogoyavlenskii lattice hierarchy. All these constraints can be written in the form of discrete conservation law $I_{i+1}=I_i$ with appropriate homogeneous polynomial discrete function $I=I[a]$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0902.4517","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":"0902.4517","created_at":"2026-05-18T02:14:38.772538+00:00"},{"alias_kind":"arxiv_version","alias_value":"0902.4517v3","created_at":"2026-05-18T02:14:38.772538+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0902.4517","created_at":"2026-05-18T02:14:38.772538+00:00"},{"alias_kind":"pith_short_12","alias_value":"SMYJT4VQ2WFY","created_at":"2026-05-18T12:26:01.383474+00:00"},{"alias_kind":"pith_short_16","alias_value":"SMYJT4VQ2WFYYQE7","created_at":"2026-05-18T12:26:01.383474+00:00"},{"alias_kind":"pith_short_8","alias_value":"SMYJT4VQ","created_at":"2026-05-18T12:26:01.383474+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2605.29722","citing_title":"A non-commutative discrete first Painlev\\'e hierarchy: the Lax pair approach","ref_index":9,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/SMYJT4VQ2WFYYQE757WFGJQGM6","json":"https://pith.science/pith/SMYJT4VQ2WFYYQE757WFGJQGM6.json","graph_json":"https://pith.science/api/pith-number/SMYJT4VQ2WFYYQE757WFGJQGM6/graph.json","events_json":"https://pith.science/api/pith-number/SMYJT4VQ2WFYYQE757WFGJQGM6/events.json","paper":"https://pith.science/paper/SMYJT4VQ"},"agent_actions":{"view_html":"https://pith.science/pith/SMYJT4VQ2WFYYQE757WFGJQGM6","download_json":"https://pith.science/pith/SMYJT4VQ2WFYYQE757WFGJQGM6.json","view_paper":"https://pith.science/paper/SMYJT4VQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=0902.4517&json=true","fetch_graph":"https://pith.science/api/pith-number/SMYJT4VQ2WFYYQE757WFGJQGM6/graph.json","fetch_events":"https://pith.science/api/pith-number/SMYJT4VQ2WFYYQE757WFGJQGM6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SMYJT4VQ2WFYYQE757WFGJQGM6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SMYJT4VQ2WFYYQE757WFGJQGM6/action/storage_attestation","attest_author":"https://pith.science/pith/SMYJT4VQ2WFYYQE757WFGJQGM6/action/author_attestation","sign_citation":"https://pith.science/pith/SMYJT4VQ2WFYYQE757WFGJQGM6/action/citation_signature","submit_replication":"https://pith.science/pith/SMYJT4VQ2WFYYQE757WFGJQGM6/action/replication_record"}},"created_at":"2026-05-18T02:14:38.772538+00:00","updated_at":"2026-05-18T02:14:38.772538+00:00"}